Base | Representation |
---|---|
bin | 1010111011110010010001… |
… | …0001110100010111001001 |
3 | 1120120022110022220100221002 |
4 | 2232330210101310113021 |
5 | 3033433002330042301 |
6 | 41322533235024345 |
7 | 2350401604602440 |
oct | 256744421642711 |
9 | 46508408810832 |
10 | 12022222112201 |
11 | 3915660a66694 |
12 | 1421ba1a3b0b5 |
13 | 6928c956b7c2 |
14 | 2d7c43059d57 |
15 | 15cad3cc516b |
hex | aef244745c9 |
12022222112201 has 8 divisors (see below), whose sum is σ = 13875718874304. Its totient is φ = 10202734465200.
The previous prime is 12022222112179. The next prime is 12022222112239. The reversal of 12022222112201 is 10221122222021.
12022222112201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12022222112201 - 214 = 12022222095817 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12022222112501) 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, 8502278015 + ... + 8502279428.
It is an arithmetic number, because the mean of its divisors is an integer number (1734464859288).
Almost surely, 212022222112201 is an apocalyptic number.
It is an amenable number.
12022222112201 is a deficient number, since it is larger than the sum of its proper divisors (1853496762103).
12022222112201 is a wasteful number, since it uses less digits than its factorization.
12022222112201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17004557551.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 12022222112201 its reverse (10221122222021), we get a palindrome (22243344334222).
The spelling of 12022222112201 in words is "twelve trillion, twenty-two billion, two hundred twenty-two million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •