Base | Representation |
---|---|
bin | 1110111001111… |
… | …00001101110110 |
3 | 22201021001001200 |
4 | 13130330031312 |
5 | 224001332230 |
6 | 20223433330 |
7 | 3045466521 |
oct | 734741566 |
9 | 281231050 |
10 | 125027190 |
11 | 64635862 |
12 | 35a55846 |
13 | 1cb971b2 |
14 | 12867bb8 |
15 | ae9a160 |
hex | 773c376 |
125027190 has 24 divisors (see below), whose sum is σ = 325070928. Its totient is φ = 33340560.
The previous prime is 125027183. The next prime is 125027209. The reversal of 125027190 is 91720521.
125027190 is a `hidden beast` number, since 1 + 2 + 502 + 71 + 90 = 666.
It is a super-2 number, since 2×1250271902 = 31263596478592200, which contains 22 as substring.
It is a Curzon number.
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 11 ways as a sum of consecutive naturals, for example, 694506 + ... + 694685.
It is an arithmetic number, because the mean of its divisors is an integer number (13544622).
Almost surely, 2125027190 is an apocalyptic number.
125027190 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
125027190 is an abundant number, since it is smaller than the sum of its proper divisors (200043738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125027190 is a wasteful number, since it uses less digits than its factorization.
125027190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1389204 (or 1389201 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 125027190 is about 11181.5557951477. Note that the first 3 decimals coincide. The cubic root of 125027190 is about 500.0362507050.
The spelling of 125027190 in words is "one hundred twenty-five million, twenty-seven thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •