Base | Representation |
---|---|
bin | 1010111010100000101001… |
… | …0110010000010100011101 |
3 | 1120111012220101121002110212 |
4 | 2232220022112100110131 |
5 | 3033103114412344242 |
6 | 41304511202142205 |
7 | 2345664631643363 |
oct | 256501226202435 |
9 | 46435811532425 |
10 | 12000312231197 |
11 | 3907338452814 |
12 | 14198a8351965 |
13 | 6908172b0984 |
14 | 2d6b65257633 |
15 | 15c250548782 |
hex | aea0a59051d |
12000312231197 has 2 divisors, whose sum is σ = 12000312231198. Its totient is φ = 12000312231196.
The previous prime is 12000312231161. The next prime is 12000312231233. The reversal of 12000312231197 is 79113221300021.
It is a balanced prime because it is at equal distance from previous prime (12000312231161) and next prime (12000312231233).
It can be written as a sum of positive squares in only one way, i.e., 6153148146916 + 5847164084281 = 2480554^2 + 2418091^2 .
It is a cyclic number.
It is not a de Polignac number, because 12000312231197 - 28 = 12000312230941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12000312231497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000156115598 + 6000156115599.
It is an arithmetic number, because the mean of its divisors is an integer number (6000156115599).
Almost surely, 212000312231197 is an apocalyptic number.
It is an amenable number.
12000312231197 is a deficient number, since it is larger than the sum of its proper divisors (1).
12000312231197 is an equidigital number, since it uses as much as digits as its factorization.
12000312231197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 32.
The spelling of 12000312231197 in words is "twelve trillion, three hundred twelve million, two hundred thirty-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •