Base | Representation |
---|---|
bin | 1010111011101110000110… |
… | …0101100110000110100001 |
3 | 1120120012120100111220202202 |
4 | 2232323201211212012201 |
5 | 3033423204411120301 |
6 | 41322230225222545 |
7 | 2350332100315412 |
oct | 256734145460641 |
9 | 46505510456682 |
10 | 12021103223201 |
11 | 391513741a836 |
12 | 142192b191a55 |
13 | 69277b8062c7 |
14 | 2d7b78601809 |
15 | 15ca6a95c66b |
hex | aeee19661a1 |
12021103223201 has 2 divisors, whose sum is σ = 12021103223202. Its totient is φ = 12021103223200.
The previous prime is 12021103223197. The next prime is 12021103223219. The reversal of 12021103223201 is 10232230112021.
12021103223201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11582614248976 + 438488974225 = 3403324^2 + 662185^2 .
It is a cyclic number.
It is not a de Polignac number, because 12021103223201 - 22 = 12021103223197 is a prime.
It is not a weakly prime, because it can be changed into another prime (12021103223291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6010551611600 + 6010551611601.
It is an arithmetic number, because the mean of its divisors is an integer number (6010551611601).
Almost surely, 212021103223201 is an apocalyptic number.
It is an amenable number.
12021103223201 is a deficient number, since it is larger than the sum of its proper divisors (1).
12021103223201 is an equidigital number, since it uses as much as digits as its factorization.
12021103223201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 12021103223201 its reverse (10232230112021), we get a palindrome (22253333335222).
The spelling of 12021103223201 in words is "twelve trillion, twenty-one billion, one hundred three million, two hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •