Base | Representation |
---|---|
bin | 1000111100010110100… |
… | …1010111000001010111 |
3 | 112200120102101222022102 |
4 | 2033011221113001113 |
5 | 10004123242342421 |
6 | 154325310152315 |
7 | 14046223554425 |
oct | 2170551270127 |
9 | 480512358272 |
10 | 153639809111 |
11 | 5a181737658 |
12 | 259397b269b |
13 | 1164668a269 |
14 | 7616d44115 |
15 | 3ee340660b |
hex | 23c5a57057 |
153639809111 has 2 divisors, whose sum is σ = 153639809112. Its totient is φ = 153639809110.
The previous prime is 153639809047. The next prime is 153639809143. The reversal of 153639809111 is 111908936351.
153639809111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (111908936351) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 153639809111 - 26 = 153639809047 is a prime.
It is a super-2 number, since 2×1536398091112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153639809171) 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, 76819904555 + 76819904556.
It is an arithmetic number, because the mean of its divisors is an integer number (76819904556).
Almost surely, 2153639809111 is an apocalyptic number.
153639809111 is a deficient number, since it is larger than the sum of its proper divisors (1).
153639809111 is an equidigital number, since it uses as much as digits as its factorization.
153639809111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174960, while the sum is 47.
The spelling of 153639809111 in words is "one hundred fifty-three billion, six hundred thirty-nine million, eight hundred nine thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •