Base | Representation |
---|---|
bin | 1010111010100111011000… |
… | …0110011011000011101001 |
3 | 1120111101120101021021210011 |
4 | 2232221312012123003221 |
5 | 3033120320211121301 |
6 | 41305410421251521 |
7 | 2346060502621303 |
oct | 256516606330351 |
9 | 46441511237704 |
10 | 12002120020201 |
11 | 3908085947413 |
12 | 141a111863ba1 |
13 | 690a4499a0cc |
14 | 2d6c9739a973 |
15 | 15c3090dea51 |
hex | aea7619b0e9 |
12002120020201 has 8 divisors (see below), whose sum is σ = 12634259103200. Its totient is φ = 11370025792800.
The previous prime is 12002120020169. The next prime is 12002120020217. The reversal of 12002120020201 is 10202002120021.
It is a happy number.
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 12002120020201 - 25 = 12002120020169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12002120020271) 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 7 ways as a sum of consecutive naturals, for example, 10663971 + ... + 11735608.
It is an arithmetic number, because the mean of its divisors is an integer number (1579282387900).
Almost surely, 212002120020201 is an apocalyptic number.
It is an amenable number.
12002120020201 is a deficient number, since it is larger than the sum of its proper divisors (632139082999).
12002120020201 is a wasteful number, since it uses less digits than its factorization.
12002120020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22427799.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 12002120020201 its reverse (10202002120021), we get a palindrome (22204122140222).
The spelling of 12002120020201 in words is "twelve trillion, two billion, one hundred twenty million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •