Base | Representation |
---|---|
bin | 11011010011101101111000… |
… | …111110011001001011001011 |
3 | 120202020122202211100001110111 |
4 | 123103231320332121023023 |
5 | 111220223301212320021 |
6 | 1103234104500055151 |
7 | 34204045323651544 |
oct | 3323557076311313 |
9 | 522218684301414 |
10 | 120102200120011 |
11 | 352a5069a0100a |
12 | 1157873b9944b7 |
13 | 52027869b0575 |
14 | 2192d9839d4cb |
15 | dd4201ad28e1 |
hex | 6d3b78f992cb |
120102200120011 has 8 divisors (see below), whose sum is σ = 126468503686800. Its totient is φ = 113740410067200.
The previous prime is 120102200120003. The next prime is 120102200120039. The reversal of 120102200120011 is 110021002201021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120102200120011 - 23 = 120102200120003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120102200119973 and 120102200120000.
It is not an unprimeable number, because it can be changed into a prime (120102200127011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1128323866 + ... + 1128430303.
It is an arithmetic number, because the mean of its divisors is an integer number (15808562960850).
Almost surely, 2120102200120011 is an apocalyptic number.
120102200120011 is a deficient number, since it is larger than the sum of its proper divisors (6366303566789).
120102200120011 is a wasteful number, since it uses less digits than its factorization.
120102200120011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2256756989.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120102200120011 its reverse (110021002201021), we get a palindrome (230123202321032).
The spelling of 120102200120011 in words is "one hundred twenty trillion, one hundred two billion, two hundred million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •