Base | Representation |
---|---|
bin | 1001011000010000010001… |
… | …1111100101100101001001 |
3 | 1100111211211100110211010002 |
4 | 2112010010133211211021 |
5 | 2322424033204220303 |
6 | 33533222415332345 |
7 | 2113016130410516 |
oct | 226040437454511 |
9 | 40454740424102 |
10 | 10312291866953 |
11 | 3316466a1094a |
12 | 11a67118210b5 |
13 | 59a5a272c88b |
14 | 27919094630d |
15 | 12d3a67c6788 |
hex | 961047e5949 |
10312291866953 has 2 divisors, whose sum is σ = 10312291866954. Its totient is φ = 10312291866952.
The previous prime is 10312291866911. The next prime is 10312291866959. The reversal of 10312291866953 is 35966819221301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9593192954944 + 719098912009 = 3097288^2 + 847997^2 .
It is an emirp because it is prime and its reverse (35966819221301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10312291866953 - 226 = 10312224758089 is a prime.
It is not a weakly prime, because it can be changed into another prime (10312291866959) 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, 5156145933476 + 5156145933477.
It is an arithmetic number, because the mean of its divisors is an integer number (5156145933477).
Almost surely, 210312291866953 is an apocalyptic number.
It is an amenable number.
10312291866953 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312291866953 is an equidigital number, since it uses as much as digits as its factorization.
10312291866953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4199040, while the sum is 56.
The spelling of 10312291866953 in words is "ten trillion, three hundred twelve billion, two hundred ninety-one million, eight hundred sixty-six thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •