Base | Representation |
---|---|
bin | 1000111010000000100… |
… | …0111101110001100101 |
3 | 112121221120100210221112 |
4 | 2032200020331301211 |
5 | 10001331200410401 |
6 | 154143031154405 |
7 | 14024513205260 |
oct | 2164010756145 |
9 | 477846323845 |
10 | 153010560101 |
11 | 59989521553 |
12 | 257a2b15a05 |
13 | 115761c0479 |
14 | 7597545cd7 |
15 | 3ea805c3bb |
hex | 23a023dc65 |
153010560101 has 16 divisors (see below), whose sum is σ = 177551468544. Its totient is φ = 129141810864.
The previous prime is 153010560097. The next prime is 153010560149. The reversal of 153010560101 is 101065010351.
It is a cyclic number.
It is not a de Polignac number, because 153010560101 - 22 = 153010560097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153010560401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1108736 + ... + 1239078.
It is an arithmetic number, because the mean of its divisors is an integer number (11096966784).
Almost surely, 2153010560101 is an apocalyptic number.
It is an amenable number.
153010560101 is a deficient number, since it is larger than the sum of its proper divisors (24540908443).
153010560101 is a wasteful number, since it uses less digits than its factorization.
153010560101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132920.
The product of its (nonzero) digits is 450, while the sum is 23.
Adding to 153010560101 its reverse (101065010351), we get a palindrome (254075570452).
The spelling of 153010560101 in words is "one hundred fifty-three billion, ten million, five hundred sixty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •