Base | Representation |
---|---|
bin | 1110111001110… |
… | …01111010110100 |
3 | 22201020120011011 |
4 | 13130321322310 |
5 | 224001032110 |
6 | 20223322004 |
7 | 3045430216 |
oct | 734717264 |
9 | 281216134 |
10 | 125017780 |
11 | 64629788 |
12 | 35a50304 |
13 | 1cb92b24 |
14 | 128645b6 |
15 | ae9748a |
hex | 7739eb4 |
125017780 has 12 divisors (see below), whose sum is σ = 262537380. Its totient is φ = 50007104.
The previous prime is 125017757. The next prime is 125017799. The reversal of 125017780 is 87710521.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 86229796 + 38787984 = 9286^2 + 6228^2 .
It is a super-2 number, since 2×1250177802 = 31258890632256800, which contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 3125425 + ... + 3125464.
It is an arithmetic number, because the mean of its divisors is an integer number (21878115).
Almost surely, 2125017780 is an apocalyptic number.
125017780 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
125017780 is an abundant number, since it is smaller than the sum of its proper divisors (137519600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125017780 is a wasteful number, since it uses less digits than its factorization.
125017780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6250898 (or 6250896 counting only the distinct ones).
The product of its (nonzero) digits is 3920, while the sum is 31.
The square root of 125017780 is about 11181.1350049984. The cubic root of 125017780 is about 500.0237055427.
The spelling of 125017780 in words is "one hundred twenty-five million, seventeen thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •