Base | Representation |
---|---|
bin | 11011010010011000000111… |
… | …011100111001010010001011 |
3 | 120201220212001021222011101101 |
4 | 123102120013130321102023 |
5 | 111212221141401400021 |
6 | 1103123513540402231 |
7 | 34164305120026651 |
oct | 3322300734712213 |
9 | 521825037864341 |
10 | 120010101200011 |
11 | 35269aa851a2a0 |
12 | 115629180a6377 |
13 | 51c6b9a08abb9 |
14 | 218c73c816dd1 |
15 | dd1b11353a91 |
hex | 6d260773948b |
120010101200011 has 32 divisors (see below), whose sum is σ = 137073421739520. Its totient is φ = 104004868492800.
The previous prime is 120010101199997. The next prime is 120010101200039. The reversal of 120010101200011 is 110002101010021.
It is not a de Polignac number, because 120010101200011 - 225 = 120010067645579 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120010101200411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 102503520 + ... + 103667698.
It is an arithmetic number, because the mean of its divisors is an integer number (4283544429360).
Almost surely, 2120010101200011 is an apocalyptic number.
120010101200011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120010101200011 is a deficient number, since it is larger than the sum of its proper divisors (17063320539509).
120010101200011 is a wasteful number, since it uses less digits than its factorization.
120010101200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1165587.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 120010101200011 its reverse (110002101010021), we get a palindrome (230012202210032).
The spelling of 120010101200011 in words is "one hundred twenty trillion, ten billion, one hundred one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •