Base | Representation |
---|---|
bin | 111010010001010100… |
… | …0001001011010100100 |
3 | 102221222212120200222000 |
4 | 1310202220021122210 |
5 | 4022234030020002 |
6 | 133253005205300 |
7 | 12016650650352 |
oct | 1644250113244 |
9 | 387885520860 |
10 | 125135001252 |
11 | 4908449a608 |
12 | 20303560830 |
13 | ba52cc2c51 |
14 | 60b130a7d2 |
15 | 33c5bc761c |
hex | 1d22a096a4 |
125135001252 has 48 divisors (see below), whose sum is σ = 324449025600. Its totient is φ = 41708459520.
The previous prime is 125135001193. The next prime is 125135001253. The reversal of 125135001252 is 252100531521.
125135001252 is a `hidden beast` number, since 1 + 25 + 13 + 500 + 125 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (125135001253) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1670727 + ... + 1744017.
It is an arithmetic number, because the mean of its divisors is an integer number (6759354700).
Almost surely, 2125135001252 is an apocalyptic number.
125135001252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
125135001252 is an abundant number, since it is smaller than the sum of its proper divisors (199314024348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125135001252 is a wasteful number, since it uses less digits than its factorization.
125135001252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89113 (or 89105 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 125135001252 its reverse (252100531521), we get a palindrome (377235532773).
The spelling of 125135001252 in words is "one hundred twenty-five billion, one hundred thirty-five million, one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •