Base | Representation |
---|---|
bin | 111010100000011011… |
… | …1000000110011100110 |
3 | 110000022012222210220200 |
4 | 1311000313000303212 |
5 | 4024303401332010 |
6 | 133415204411330 |
7 | 12035350126512 |
oct | 1650067006346 |
9 | 400265883820 |
10 | 125642214630 |
11 | 49314833519 |
12 | 204253a6b46 |
13 | bb041023ca |
14 | 611c81d142 |
15 | 34054b7cc0 |
hex | 1d40dc0ce6 |
125642214630 has 48 divisors (see below), whose sum is σ = 327656753424. Its totient is φ = 33403360320.
The previous prime is 125642214589. The next prime is 125642214671. The reversal of 125642214630 is 36412246521.
125642214630 is a `hidden beast` number, since 1 + 2 + 5 + 6 + 4 + 2 + 2 + 14 + 630 = 666.
It is an interprime number because it is at equal distance from previous prime (125642214589) and next prime (125642214671).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 2079009 + ... + 2138588.
It is an arithmetic number, because the mean of its divisors is an integer number (6826182363).
Almost surely, 2125642214630 is an apocalyptic number.
125642214630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
125642214630 is an abundant number, since it is smaller than the sum of its proper divisors (202014538794).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125642214630 is a wasteful number, since it uses less digits than its factorization.
125642214630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4217941 (or 4217938 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
The spelling of 125642214630 in words is "one hundred twenty-five billion, six hundred forty-two million, two hundred fourteen thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •