Base | Representation |
---|---|
bin | 1011110100010001110110… |
… | …1001100001001010111101 |
3 | 1201000002121201112221220021 |
4 | 2331010131221201022331 |
5 | 3200333200003242222 |
6 | 43344444151252141 |
7 | 2510461016326213 |
oct | 275043551411275 |
9 | 51002551487807 |
10 | 12992773493437 |
11 | 415a227a09421 |
12 | 155a10567a051 |
13 | 7332a077732a |
14 | 32cbd4386cb3 |
15 | 177e8a029ac7 |
hex | bd11da612bd |
12992773493437 has 2 divisors, whose sum is σ = 12992773493438. Its totient is φ = 12992773493436.
The previous prime is 12992773493309. The next prime is 12992773493443. The reversal of 12992773493437 is 73439437729921.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12992773493401 + 36 = 3604549^2 + 6^2 .
It is an emirp because it is prime and its reverse (73439437729921) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12992773493437 - 27 = 12992773493309 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12992773493477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6496386746718 + 6496386746719.
It is an arithmetic number, because the mean of its divisors is an integer number (6496386746719).
Almost surely, 212992773493437 is an apocalyptic number.
It is an amenable number.
12992773493437 is a deficient number, since it is larger than the sum of its proper divisors (1).
12992773493437 is an equidigital number, since it uses as much as digits as its factorization.
12992773493437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432081216, while the sum is 70.
The spelling of 12992773493437 in words is "twelve trillion, nine hundred ninety-two billion, seven hundred seventy-three million, four hundred ninety-three thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •