Base | Representation |
---|---|
bin | 11011010011101101101101… |
… | …001011011011110010101011 |
3 | 120202020122021000221021201120 |
4 | 123103231231023123302223 |
5 | 111220222400031241021 |
6 | 1103234033110150323 |
7 | 34204040401526361 |
oct | 3323555513336253 |
9 | 522218230837646 |
10 | 120102002212011 |
11 | 352a4a78217886 |
12 | 115786a56523a3 |
13 | 52027549a9541 |
14 | 2192d79da3631 |
15 | dd41de53d2c6 |
hex | 6d3b6d2dbcab |
120102002212011 has 4 divisors (see below), whose sum is σ = 160136002949352. Its totient is φ = 80068001474672.
The previous prime is 120102002211991. The next prime is 120102002212109. The reversal of 120102002212011 is 110212200201021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120102002212011 - 213 = 120102002203819 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120102002232011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20017000368666 + ... + 20017000368671.
It is an arithmetic number, because the mean of its divisors is an integer number (40034000737338).
Almost surely, 2120102002212011 is an apocalyptic number.
120102002212011 is a deficient number, since it is larger than the sum of its proper divisors (40034000737341).
120102002212011 is an equidigital number, since it uses as much as digits as its factorization.
120102002212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40034000737340.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120102002212011 its reverse (110212200201021), we get a palindrome (230314202413032).
The spelling of 120102002212011 in words is "one hundred twenty trillion, one hundred two billion, two million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •