Base | Representation |
---|---|
bin | 1110111010010… |
… | …00001000110101 |
3 | 22201100112001020 |
4 | 13131020020311 |
5 | 224004413041 |
6 | 20224451353 |
7 | 3046062060 |
oct | 735101065 |
9 | 281315036 |
10 | 125076021 |
11 | 64669514 |
12 | 35a79b59 |
13 | 1cbb34a5 |
14 | 1287b8d7 |
15 | aea9866 |
hex | 7748235 |
125076021 has 48 divisors (see below), whose sum is σ = 208308096. Its totient is φ = 65332224.
The previous prime is 125076013. The next prime is 125076023. The reversal of 125076021 is 120670521.
It is not a de Polignac number, because 125076021 - 23 = 125076013 is a prime.
It is a super-2 number, since 2×1250760212 = 31288022058384882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 125075982 and 125076000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125076023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 224275 + ... + 224831.
It is an arithmetic number, because the mean of its divisors is an integer number (4339752).
Almost surely, 2125076021 is an apocalyptic number.
It is an amenable number.
125076021 is a deficient number, since it is larger than the sum of its proper divisors (83232075).
125076021 is a wasteful number, since it uses less digits than its factorization.
125076021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 638 (or 621 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 24.
The square root of 125076021 is about 11183.7391332237. The cubic root of 125076021 is about 500.1013407920.
It can be divided in two parts, 12507 and 6021, that added together give a triangular number (18528 = T192).
The spelling of 125076021 in words is "one hundred twenty-five million, seventy-six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •