Base | Representation |
---|---|
bin | 111010010001101010… |
… | …0001111011000010100 |
3 | 102222000200022221121112 |
4 | 1310203110033120110 |
5 | 4022300004410040 |
6 | 133254101034152 |
7 | 12020151131366 |
oct | 1644324173024 |
9 | 388020287545 |
10 | 125146560020 |
11 | 4908aa74909 |
12 | 203073b5958 |
13 | ba5550c161 |
14 | 60b2a78d36 |
15 | 33c6c0c365 |
hex | 1d2350f614 |
125146560020 has 36 divisors (see below), whose sum is σ = 270102718620. Its totient is φ = 48705677568.
The previous prime is 125146559971. The next prime is 125146560053. The reversal of 125146560020 is 20065641521.
It can be written as a sum of positive squares in 6 ways, for example, as 7659400324 + 117487159696 = 87518^2 + 342764^2 .
It is a super-2 number, since 2×1251465600202 (a number of 23 digits) 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 11 ways as a sum of consecutive naturals, for example, 2257985 + ... + 2312744.
It is an arithmetic number, because the mean of its divisors is an integer number (7502853295).
Almost surely, 2125146560020 is an apocalyptic number.
125146560020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
125146560020 is an abundant number, since it is smaller than the sum of its proper divisors (144956158600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125146560020 is a wasteful number, since it uses less digits than its factorization.
125146560020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4570812 (or 4570773 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 32.
The spelling of 125146560020 in words is "one hundred twenty-five billion, one hundred forty-six million, five hundred sixty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •