Base | Representation |
---|---|
bin | 1001001101000100011000… |
… | …1010000110010111011011 |
3 | 1022211110210120012121010202 |
4 | 2103101012022012113123 |
5 | 2311302001210031021 |
6 | 33305041405332415 |
7 | 2063104002456635 |
oct | 223210612062733 |
9 | 38743716177122 |
10 | 10120120002011 |
11 | 3251a11a01458 |
12 | 117541b86710b |
13 | 58542816a6a6 |
14 | 26db60391a55 |
15 | 1283aa6eea0b |
hex | 934462865db |
10120120002011 has 16 divisors (see below), whose sum is σ = 10406246037600. Its totient is φ = 9835931347200.
The previous prime is 10120120001993. The next prime is 10120120002029. The reversal of 10120120002011 is 11020002102101.
It is an interprime number because it is at equal distance from previous prime (10120120001993) and next prime (10120120002029).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10120120002011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10120120001983 and 10120120002001.
It is not an unprimeable number, because it can be changed into a prime (10120120005011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11824580 + ... + 12651518.
It is an arithmetic number, because the mean of its divisors is an integer number (650390377350).
Almost surely, 210120120002011 is an apocalyptic number.
10120120002011 is a deficient number, since it is larger than the sum of its proper divisors (286126035589).
10120120002011 is an equidigital number, since it uses as much as digits as its factorization.
10120120002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 828110.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10120120002011 its reverse (11020002102101), we get a palindrome (21140122104112).
The spelling of 10120120002011 in words is "ten trillion, one hundred twenty billion, one hundred twenty million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •