Base | Representation |
---|---|
bin | 1010111010100110111110… |
… | …0011001100011111011001 |
3 | 1120111101021201110220001212 |
4 | 2232221233203030133121 |
5 | 3033120104042402301 |
6 | 41305351453552505 |
7 | 2346054666533051 |
oct | 256515743143731 |
9 | 46441251426055 |
10 | 12002010122201 |
11 | 3908029905420 |
12 | 141a0a0aa5735 |
13 | 690a27c9c2c8 |
14 | 2d6c86950561 |
15 | 15c2ee6324bb |
hex | aea6f8cc7d9 |
12002010122201 has 8 divisors (see below), whose sum is σ = 13128204105984. Its totient is φ = 10881666497520.
The previous prime is 12002010122197. The next prime is 12002010122233. The reversal of 12002010122201 is 10222101020021.
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 12002010122201 - 22 = 12002010122197 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12002010122251) 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, 1462585481 + ... + 1462593686.
It is an arithmetic number, because the mean of its divisors is an integer number (1641025513248).
Almost surely, 212002010122201 is an apocalyptic number.
12002010122201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12002010122201 is a deficient number, since it is larger than the sum of its proper divisors (1126193983783).
12002010122201 is a wasteful number, since it uses less digits than its factorization.
12002010122201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2925179551.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12002010122201 its reverse (10222101020021), we get a palindrome (22224111142222).
The spelling of 12002010122201 in words is "twelve trillion, two billion, ten million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •