Base | Representation |
---|---|
bin | 1001011000010001101101… |
… | …1010010100111100101001 |
3 | 1100111212211010222022000011 |
4 | 2112010123122110330221 |
5 | 2322430330122122243 |
6 | 33533324512411521 |
7 | 2113031506523416 |
oct | 226043332247451 |
9 | 40455733868004 |
10 | 10312676364073 |
11 | 3316643a58266 |
12 | 11a67ba546ba1 |
13 | 59a6342a3975 |
14 | 2791c9a3310d |
15 | 12d3ca42689d |
hex | 9611b694f29 |
10312676364073 has 2 divisors, whose sum is σ = 10312676364074. Its totient is φ = 10312676364072.
The previous prime is 10312676364041. The next prime is 10312676364077. The reversal of 10312676364073 is 37046367621301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8650116267664 + 1662560096409 = 2941108^2 + 1289403^2 .
It is an emirp because it is prime and its reverse (37046367621301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10312676364073 - 25 = 10312676364041 is a prime.
It is a super-2 number, since 2×103126763640732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10312676364077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5156338182036 + 5156338182037.
It is an arithmetic number, because the mean of its divisors is an integer number (5156338182037).
Almost surely, 210312676364073 is an apocalyptic number.
It is an amenable number.
10312676364073 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312676364073 is an equidigital number, since it uses as much as digits as its factorization.
10312676364073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2286144, while the sum is 49.
The spelling of 10312676364073 in words is "ten trillion, three hundred twelve billion, six hundred seventy-six million, three hundred sixty-four thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •