Base | Representation |
---|---|
bin | 1010111010100110111110… |
… | …0010110100000100001101 |
3 | 1120111101021201021210211112 |
4 | 2232221233202310010031 |
5 | 3033120104031202112 |
6 | 41305351451501405 |
7 | 2346054665635301 |
oct | 256515742640415 |
9 | 46441251253745 |
10 | 12002010022157 |
11 | 3908029847241 |
12 | 141a0a0a57865 |
13 | 690a27c658cc |
14 | 2d6c86925d01 |
15 | 15c2ee612a22 |
hex | aea6f8b410d |
12002010022157 has 2 divisors, whose sum is σ = 12002010022158. Its totient is φ = 12002010022156.
The previous prime is 12002010022151. The next prime is 12002010022241. The reversal of 12002010022157 is 75122001020021.
12002010022157 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., 11990332842436 + 11677179721 = 3462706^2 + 108061^2 .
It is a cyclic number.
It is not a de Polignac number, because 12002010022157 - 214 = 12002010005773 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12002010022151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001005011078 + 6001005011079.
It is an arithmetic number, because the mean of its divisors is an integer number (6001005011079).
Almost surely, 212002010022157 is an apocalyptic number.
It is an amenable number.
12002010022157 is a deficient number, since it is larger than the sum of its proper divisors (1).
12002010022157 is an equidigital number, since it uses as much as digits as its factorization.
12002010022157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 560, while the sum is 23.
Adding to 12002010022157 its reverse (75122001020021), we get a palindrome (87124011042178).
The spelling of 12002010022157 in words is "twelve trillion, two billion, ten million, twenty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •