Base | Representation |
---|---|
bin | 10000100010000111000010… |
… | …001111000001110001100111 |
3 | 100112110021100021021220102201 |
4 | 100202013002033001301213 |
5 | 34012311213034321234 |
6 | 414351440354315331 |
7 | 21213215656553422 |
oct | 2042070217016147 |
9 | 315407307256381 |
10 | 72712760073319 |
11 | 21194343497543 |
12 | 81a4278288b47 |
13 | 3175a26183342 |
14 | 13d546016c9b9 |
15 | 86165bdd8314 |
hex | 4221c23c1c67 |
72712760073319 has 2 divisors, whose sum is σ = 72712760073320. Its totient is φ = 72712760073318.
The previous prime is 72712760073227. The next prime is 72712760073403. The reversal of 72712760073319 is 91337006721727.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 72712760073319 - 223 = 72712751684711 is a prime.
It is a super-2 number, since 2×727127600733192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 72712760073319.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (72712760073619) 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, 36356380036659 + 36356380036660.
It is an arithmetic number, because the mean of its divisors is an integer number (36356380036660).
Almost surely, 272712760073319 is an apocalyptic number.
72712760073319 is a deficient number, since it is larger than the sum of its proper divisors (1).
72712760073319 is an equidigital number, since it uses as much as digits as its factorization.
72712760073319 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4667544, while the sum is 55.
The spelling of 72712760073319 in words is "seventy-two trillion, seven hundred twelve billion, seven hundred sixty million, seventy-three thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •