Base | Representation |
---|---|
bin | 100010110011011001000110… |
… | …000101011010010110111101 |
3 | 202001221220002101021112120012 |
4 | 202303121012011122112331 |
5 | 130030310032400144103 |
6 | 1301313105205233005 |
7 | 44145411564444206 |
oct | 4263310605322675 |
9 | 661856071245505 |
10 | 153065220318653 |
11 | 44853660516735 |
12 | 15201094702765 |
13 | 6753cb0504336 |
14 | 29b25792185ad |
15 | 12a689e84c2d8 |
hex | 8b364615a5bd |
153065220318653 has 2 divisors, whose sum is σ = 153065220318654. Its totient is φ = 153065220318652.
The previous prime is 153065220318611. The next prime is 153065220318721. The reversal of 153065220318653 is 356813022560351.
153065220318653 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 141877948030009 + 11187272288644 = 11911253^2 + 3344738^2 .
It is a cyclic number.
It is not a de Polignac number, because 153065220318653 - 26 = 153065220318589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153065220318053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76532610159326 + 76532610159327.
It is an arithmetic number, because the mean of its divisors is an integer number (76532610159327).
Almost surely, 2153065220318653 is an apocalyptic number.
It is an amenable number.
153065220318653 is a deficient number, since it is larger than the sum of its proper divisors (1).
153065220318653 is an equidigital number, since it uses as much as digits as its factorization.
153065220318653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888000, while the sum is 50.
The spelling of 153065220318653 in words is "one hundred fifty-three trillion, sixty-five billion, two hundred twenty million, three hundred eighteen thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •