Base | Representation |
---|---|
bin | 11011010101001001001010… |
… | …010010111000100010011011 |
3 | 120202121000201200200020200111 |
4 | 123111021022102320202123 |
5 | 111223330003002210021 |
6 | 1103351113215345151 |
7 | 34214115016325236 |
oct | 3325111222704233 |
9 | 522530650606614 |
10 | 120200201210011 |
11 | 35332689a7447a |
12 | 115937302221b7 |
13 | 520baa4337b10 |
14 | 2197a13b6a41d |
15 | dd6a3a5c28e1 |
hex | 6d524a4b889b |
120200201210011 has 16 divisors (see below), whose sum is σ = 129515362653600. Its totient is φ = 110894901596928.
The previous prime is 120200201210003. The next prime is 120200201210029. The reversal of 120200201210011 is 110012102002021.
It is a cyclic number.
It is not a de Polignac number, because 120200201210011 - 23 = 120200201210003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120200201209973 and 120200201210000.
It is not an unprimeable number, because it can be changed into a prime (120200201210311) 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, 546207360 + ... + 546427378.
It is an arithmetic number, because the mean of its divisors is an integer number (8094710165850).
Almost surely, 2120200201210011 is an apocalyptic number.
120200201210011 is a deficient number, since it is larger than the sum of its proper divisors (9315161443589).
120200201210011 is a wasteful number, since it uses less digits than its factorization.
120200201210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 242238.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120200201210011 its reverse (110012102002021), we get a palindrome (230212303212032).
The spelling of 120200201210011 in words is "one hundred twenty trillion, two hundred billion, two hundred one million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •