Base | Representation |
---|---|
bin | 1000111101010000001… |
… | …0100111101101110001 |
3 | 112201012020211121011001 |
4 | 2033110002213231301 |
5 | 10010122103441423 |
6 | 154405254322001 |
7 | 14055215400004 |
oct | 2172402475561 |
9 | 481166747131 |
10 | 153881312113 |
11 | 5a295a97411 |
12 | 259a6659301 |
13 | 11684716249 |
14 | 763b04b53b |
15 | 400970ccad |
hex | 23d40a7b71 |
153881312113 has 64 divisors (see below), whose sum is σ = 181488384000. Its totient is φ = 129404335104.
The previous prime is 153881312111. The next prime is 153881312153. The reversal of 153881312113 is 311213188351.
153881312113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 153881312113 - 21 = 153881312111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (153881312111) 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 in 63 ways as a sum of consecutive naturals, for example, 248596318 + ... + 248596936.
It is an arithmetic number, because the mean of its divisors is an integer number (2835756000).
Almost surely, 2153881312113 is an apocalyptic number.
It is an amenable number.
153881312113 is a deficient number, since it is larger than the sum of its proper divisors (27607071887).
153881312113 is a wasteful number, since it uses less digits than its factorization.
153881312113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1094.
The product of its digits is 17280, while the sum is 37.
The spelling of 153881312113 in words is "one hundred fifty-three billion, eight hundred eighty-one million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •