Base | Representation |
---|---|
bin | 1010111010100001000110… |
… | …0111111010110100011101 |
3 | 1120111020012220021221110111 |
4 | 2232220101213322310131 |
5 | 3033103342140132422 |
6 | 41304531242410021 |
7 | 2346000643351543 |
oct | 256502147726435 |
9 | 46436186257414 |
10 | 12000434302237 |
11 | 39073a0349577 |
12 | 1419921200911 |
13 | 690836681464 |
14 | 2d6b77551d93 |
15 | 15c25b10ca77 |
hex | aea119fad1d |
12000434302237 has 2 divisors, whose sum is σ = 12000434302238. Its totient is φ = 12000434302236.
The previous prime is 12000434302141. The next prime is 12000434302249. The reversal of 12000434302237 is 73220343400021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11444188321476 + 556245980761 = 3382926^2 + 745819^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12000434302237 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12000434302199 and 12000434302208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12000434302267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000217151118 + 6000217151119.
It is an arithmetic number, because the mean of its divisors is an integer number (6000217151119).
Almost surely, 212000434302237 is an apocalyptic number.
It is an amenable number.
12000434302237 is a deficient number, since it is larger than the sum of its proper divisors (1).
12000434302237 is an equidigital number, since it uses as much as digits as its factorization.
12000434302237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24192, while the sum is 31.
Adding to 12000434302237 its reverse (73220343400021), we get a palindrome (85220777702258).
The spelling of 12000434302237 in words is "twelve trillion, four hundred thirty-four million, three hundred two thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •