Base | Representation |
---|---|
bin | 1000111010000011011… |
… | …0111111101101010001 |
3 | 112121222102001212010102 |
4 | 2032200312333231101 |
5 | 10001342243023031 |
6 | 154144141542145 |
7 | 14025020602553 |
oct | 2164066775521 |
9 | 477872055112 |
10 | 153022626641 |
11 | 599953132a5 |
12 | 257a6b74955 |
13 | 11578856831 |
14 | 7598da74d3 |
15 | 3ea91427cb |
hex | 23a0dbfb51 |
153022626641 has 2 divisors, whose sum is σ = 153022626642. Its totient is φ = 153022626640.
The previous prime is 153022626629. The next prime is 153022626707. The reversal of 153022626641 is 146626220351.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88470553600 + 64552073041 = 297440^2 + 254071^2 .
It is a cyclic number.
It is not a de Polignac number, because 153022626641 - 26 = 153022626577 is a prime.
It is a super-2 number, since 2×1530226266412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 153022626595 and 153022626604.
It is not a weakly prime, because it can be changed into another prime (153022646641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76511313320 + 76511313321.
It is an arithmetic number, because the mean of its divisors is an integer number (76511313321).
Almost surely, 2153022626641 is an apocalyptic number.
It is an amenable number.
153022626641 is a deficient number, since it is larger than the sum of its proper divisors (1).
153022626641 is an equidigital number, since it uses as much as digits as its factorization.
153022626641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 38.
Adding to 153022626641 its reverse (146626220351), we get a palindrome (299648846992).
The spelling of 153022626641 in words is "one hundred fifty-three billion, twenty-two million, six hundred twenty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •