Base | Representation |
---|---|
bin | 111010010001110101… |
… | …0101010001111010001 |
3 | 102222001002101112120220 |
4 | 1310203222222033101 |
5 | 4022303010442301 |
6 | 133254431023253 |
7 | 12020252110131 |
oct | 1644352521721 |
9 | 388032345526 |
10 | 125152437201 |
11 | 49093319490 |
12 | 2030936ab29 |
13 | ba567b928c |
14 | 60b3768ac1 |
15 | 33c74bd936 |
hex | 1d23aaa3d1 |
125152437201 has 32 divisors (see below), whose sum is σ = 192037063680. Its totient is φ = 71701819200.
The previous prime is 125152437133. The next prime is 125152437203. The reversal of 125152437201 is 102734251521.
It is a happy number.
It is not a de Polignac number, because 125152437201 - 213 = 125152429009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (125152437203) 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 31 ways as a sum of consecutive naturals, for example, 72556 + ... + 505538.
It is an arithmetic number, because the mean of its divisors is an integer number (6001158240).
Almost surely, 2125152437201 is an apocalyptic number.
125152437201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
125152437201 is a deficient number, since it is larger than the sum of its proper divisors (66884626479).
125152437201 is a wasteful number, since it uses less digits than its factorization.
125152437201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433477.
The product of its (nonzero) digits is 16800, while the sum is 33.
Adding to 125152437201 its reverse (102734251521), we get a palindrome (227886688722).
The spelling of 125152437201 in words is "one hundred twenty-five billion, one hundred fifty-two million, four hundred thirty-seven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •