Base | Representation |
---|---|
bin | 10000011010110011000000… |
… | …001010010111010001100001 |
3 | 100110200020011222102111100212 |
4 | 100122303000022113101201 |
5 | 33431043004303410333 |
6 | 413324525302423505 |
7 | 21132005264504141 |
oct | 2032630012272141 |
9 | 313606158374325 |
10 | 72210214122593 |
11 | 210101a83a0638 |
12 | 81229a6731b95 |
13 | 313a517737b61 |
14 | 13b8dc8b76921 |
15 | 8535479ee448 |
hex | 41acc0297461 |
72210214122593 has 2 divisors, whose sum is σ = 72210214122594. Its totient is φ = 72210214122592.
The previous prime is 72210214122547. The next prime is 72210214122601. The reversal of 72210214122593 is 39522141201227.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70897191482209 + 1313022640384 = 8420047^2 + 1145872^2 .
It is a cyclic number.
It is not a de Polignac number, because 72210214122593 - 216 = 72210214057057 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 72210214122593.
It is not a weakly prime, because it can be changed into another prime (72210210122593) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 36105107061296 + 36105107061297.
It is an arithmetic number, because the mean of its divisors is an integer number (36105107061297).
Almost surely, 272210214122593 is an apocalyptic number.
It is an amenable number.
72210214122593 is a deficient number, since it is larger than the sum of its proper divisors (1).
72210214122593 is an equidigital number, since it uses as much as digits as its factorization.
72210214122593 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120960, while the sum is 41.
The spelling of 72210214122593 in words is "seventy-two trillion, two hundred ten billion, two hundred fourteen million, one hundred twenty-two thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •