Base | Representation |
---|---|
bin | 1000111010101101111… |
… | …1011110110110011101 |
3 | 112122102211201210000012 |
4 | 2032223133132312131 |
5 | 10002223424342000 |
6 | 154213553213005 |
7 | 14032315055060 |
oct | 2165337366635 |
9 | 478384653005 |
10 | 153201012125 |
11 | 59a76a82a17 |
12 | 25836861165 |
13 | 115a67b3885 |
14 | 75b49608d7 |
15 | 3eb9b2c735 |
hex | 23ab7ded9d |
153201012125 has 64 divisors (see below), whose sum is σ = 221604844032. Its totient is φ = 103574016000.
The previous prime is 153201012121. The next prime is 153201012161. The reversal of 153201012125 is 521210102351.
It is not a de Polignac number, because 153201012125 - 22 = 153201012121 is a prime.
It is a super-2 number, since 2×1532010121252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 153201012125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153201012121) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 17991869 + ... + 18000381.
It is an arithmetic number, because the mean of its divisors is an integer number (3462575688).
Almost surely, 2153201012125 is an apocalyptic number.
It is an amenable number.
153201012125 is a deficient number, since it is larger than the sum of its proper divisors (68403831907).
153201012125 is a wasteful number, since it uses less digits than its factorization.
153201012125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8823 (or 8813 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 153201012125 its reverse (521210102351), we get a palindrome (674411114476).
The spelling of 153201012125 in words is "one hundred fifty-three billion, two hundred one million, twelve thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •