Base | Representation |
---|---|
bin | 1010111010100111011000… |
… | …0111000111001110100010 |
3 | 1120111101120101121110221221 |
4 | 2232221312013013032202 |
5 | 3033120320232413442 |
6 | 41305410425205254 |
7 | 2346060504303622 |
oct | 256516607071642 |
9 | 46441511543857 |
10 | 12002120201122 |
11 | 3908085a60337 |
12 | 141a11193082a |
13 | 690a44a3156c |
14 | 2d6c97406882 |
15 | 15c309128467 |
hex | aea761c73a2 |
12002120201122 has 8 divisors (see below), whose sum is σ = 18094567004316. Its totient is φ = 5970597866352.
The previous prime is 12002120201069. The next prime is 12002120201129. The reversal of 12002120201122 is 22110202120021.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 11969115848881 + 33004352241 = 3459641^2 + 181671^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 12002120201096 and 12002120201105.
It is not an unprimeable number, because it can be changed into a prime (12002120201129) 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 3 ways as a sum of consecutive naturals, for example, 15231116613 + ... + 15231117400.
Almost surely, 212002120201122 is an apocalyptic number.
12002120201122 is a deficient number, since it is larger than the sum of its proper divisors (6092446803194).
12002120201122 is a wasteful number, since it uses less digits than its factorization.
12002120201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30462234212.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12002120201122 its reverse (22110202120021), we get a palindrome (34112322321143).
The spelling of 12002120201122 in words is "twelve trillion, two billion, one hundred twenty million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •