Base | Representation |
---|---|
bin | 10110010110110000… |
… | …00101101100010101 |
3 | 1010222102221000001022 |
4 | 23023120011230111 |
5 | 144040004233323 |
6 | 5302541010525 |
7 | 603264344144 |
oct | 131330055425 |
9 | 33872830038 |
10 | 12002024213 |
11 | 50a9914483 |
12 | 23ab553a45 |
13 | 11936c2c9a |
14 | 81bdc775b |
15 | 4a3a204c8 |
hex | 2cb605b15 |
12002024213 has 2 divisors, whose sum is σ = 12002024214. Its totient is φ = 12002024212.
The previous prime is 12002024173. The next prime is 12002024231. The reversal of 12002024213 is 31242020021.
Together with next prime (12002024231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8147228644 + 3854795569 = 90262^2 + 62087^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12002024213 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12002024191 and 12002024200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12002024233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001012106 + 6001012107.
It is an arithmetic number, because the mean of its divisors is an integer number (6001012107).
Almost surely, 212002024213 is an apocalyptic number.
It is an amenable number.
12002024213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12002024213 is an equidigital number, since it uses as much as digits as its factorization.
12002024213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 12002024213 its reverse (31242020021), we get a palindrome (43244044234).
The spelling of 12002024213 in words is "twelve billion, two million, twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •