Base | Representation |
---|---|
bin | 1011000110101101111000… |
… | …0101110110110100001101 |
3 | 1121020021012111122200010212 |
4 | 2301223132011312310031 |
5 | 3100022111410214204 |
6 | 41545112430412205 |
7 | 2400100520124653 |
oct | 261533605666415 |
9 | 47207174580125 |
10 | 12210023132429 |
11 | 398827281a821 |
12 | 1452474061065 |
13 | 6a7528438345 |
14 | 302d7ad24dd3 |
15 | 1629262c1c6e |
hex | b1ade176d0d |
12210023132429 has 2 divisors, whose sum is σ = 12210023132430. Its totient is φ = 12210023132428.
The previous prime is 12210023132413. The next prime is 12210023132431. The reversal of 12210023132429 is 92423132001221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11823385405225 + 386637727204 = 3438515^2 + 621802^2 .
It is a cyclic number.
It is not a de Polignac number, because 12210023132429 - 24 = 12210023132413 is a prime.
Together with 12210023132431, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 12210023132395 and 12210023132404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12210023132459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105011566214 + 6105011566215.
It is an arithmetic number, because the mean of its divisors is an integer number (6105011566215).
Almost surely, 212210023132429 is an apocalyptic number.
It is an amenable number.
12210023132429 is a deficient number, since it is larger than the sum of its proper divisors (1).
12210023132429 is an equidigital number, since it uses as much as digits as its factorization.
12210023132429 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 12210023132429 in words is "twelve trillion, two hundred ten billion, twenty-three million, one hundred thirty-two thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •