Base | Representation |
---|---|
bin | 1111000010100010111001… |
… | …10110100000000011000101 |
3 | 11100002201200201020112011222 |
4 | 13201101130312200003011 |
5 | 13313331101312020432 |
6 | 154201234243210125 |
7 | 6652300651234664 |
oct | 741213466400305 |
9 | 140081621215158 |
10 | 33072805970117 |
11 | a5a1109844771 |
12 | 3861893976945 |
13 | 155b9a1824234 |
14 | 824a377d4ddb |
15 | 3c5476147112 |
hex | 1e145cda00c5 |
33072805970117 has 2 divisors, whose sum is σ = 33072805970118. Its totient is φ = 33072805970116.
The previous prime is 33072805970107. The next prime is 33072805970131. The reversal of 33072805970117 is 71107950827033.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29541116410276 + 3531689559841 = 5435174^2 + 1879279^2 .
It is an emirp because it is prime and its reverse (71107950827033) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 33072805970117 - 212 = 33072805966021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33072805970107) 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, 16536402985058 + 16536402985059.
It is an arithmetic number, because the mean of its divisors is an integer number (16536402985059).
Almost surely, 233072805970117 is an apocalyptic number.
It is an amenable number.
33072805970117 is a deficient number, since it is larger than the sum of its proper divisors (1).
33072805970117 is an equidigital number, since it uses as much as digits as its factorization.
33072805970117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2222640, while the sum is 53.
The spelling of 33072805970117 in words is "thirty-three trillion, seventy-two billion, eight hundred five million, nine hundred seventy thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •