Base | Representation |
---|---|
bin | 100011011110001011011100… |
… | …0110100111101111101000001 |
3 | 1111220201221221001200020000212 |
4 | 1012330112320310331331001 |
5 | 311343442012012022123 |
6 | 3023331512532523505 |
7 | 122502023306056565 |
oct | 10674267064757501 |
9 | 1456657831606025 |
10 | 312011000110913 |
11 | 904641384a8484 |
12 | 2abb19a4780595 |
13 | 10513684a5a66c |
14 | 57095ad3136a5 |
15 | 26111c7341878 |
hex | 11bc5b8d3df41 |
312011000110913 has 2 divisors, whose sum is σ = 312011000110914. Its totient is φ = 312011000110912.
The previous prime is 312011000110871. The next prime is 312011000110967. The reversal of 312011000110913 is 319011000110213.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 227958904462864 + 84052095648049 = 15098308^2 + 9167993^2 .
It is a cyclic number.
It is not a de Polignac number, because 312011000110913 - 28 = 312011000110657 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (312011000310913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156005500055456 + 156005500055457.
It is an arithmetic number, because the mean of its divisors is an integer number (156005500055457).
Almost surely, 2312011000110913 is an apocalyptic number.
It is an amenable number.
312011000110913 is a deficient number, since it is larger than the sum of its proper divisors (1).
312011000110913 is an equidigital number, since it uses as much as digits as its factorization.
312011000110913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 23.
The spelling of 312011000110913 in words is "three hundred twelve trillion, eleven billion, one hundred ten thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •