Base | Representation |
---|---|
bin | 1110111110110… |
… | …11001000101101 |
3 | 22202111002222101 |
4 | 13133123020231 |
5 | 224133200000 |
6 | 20245415101 |
7 | 3054150346 |
oct | 737331055 |
9 | 282432871 |
10 | 125678125 |
11 | 64a3a921 |
12 | 3610a491 |
13 | 20064571 |
14 | 129970cd |
15 | b077e6a |
hex | 77db22d |
125678125 has 24 divisors (see below), whose sum is σ = 158802336. Its totient is φ = 99450000.
The previous prime is 125678107. The next prime is 125678209. The reversal of 125678125 is 521876521.
It is not a de Polignac number, because 125678125 - 217 = 125547053 is a prime.
It is a super-2 number, since 2×1256781252 = 31589982207031250, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian 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 23 ways as a sum of consecutive naturals, for example, 409222 + ... + 409528.
It is an arithmetic number, because the mean of its divisors is an integer number (6616764).
Almost surely, 2125678125 is an apocalyptic number.
It is an amenable number.
125678125 is a deficient number, since it is larger than the sum of its proper divisors (33124211).
125678125 is an frugal number, since it uses more digits than its factorization.
With its successor (125678126) it forms a Ruth-Aaron pair, since the sum of their distinct prime factors is the same (443).
125678125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 463 (or 443 counting only the distinct ones).
The product of its digits is 33600, while the sum is 37.
The square root of 125678125 is about 11210.6255400847. The cubic root of 125678125 is about 500.9025365420.
The spelling of 125678125 in words is "one hundred twenty-five million, six hundred seventy-eight thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •