Base | Representation |
---|---|
bin | 1000111100001101011… |
… | …0001101000001101111 |
3 | 112200110201211002211211 |
4 | 2033003112031001233 |
5 | 10004033403424012 |
6 | 154321411255251 |
7 | 14045244636565 |
oct | 2170326150157 |
9 | 480421732754 |
10 | 153601233007 |
11 | 5a161989882 |
12 | 259288aa527 |
13 | 1163b6a1871 |
14 | 7611b81a35 |
15 | 3eded366a7 |
hex | 23c358d06f |
153601233007 has 2 divisors, whose sum is σ = 153601233008. Its totient is φ = 153601233006.
The previous prime is 153601232977. The next prime is 153601233043. The reversal of 153601233007 is 700332106351.
153601233007 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 is a cyclic number.
It is not a de Polignac number, because 153601233007 - 223 = 153592844399 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 153601233007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153601933007) 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, 76800616503 + 76800616504.
It is an arithmetic number, because the mean of its divisors is an integer number (76800616504).
Almost surely, 2153601233007 is an apocalyptic number.
153601233007 is a deficient number, since it is larger than the sum of its proper divisors (1).
153601233007 is an equidigital number, since it uses as much as digits as its factorization.
153601233007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 31.
Adding to 153601233007 its reverse (700332106351), we get a palindrome (853933339358).
The spelling of 153601233007 in words is "one hundred fifty-three billion, six hundred one million, two hundred thirty-three thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •