Base | Representation |
---|---|
bin | 111010101000101110… |
… | …0011101110111011000 |
3 | 110001000121120120101100 |
4 | 1311101130131313120 |
5 | 4030341114442230 |
6 | 133502544351400 |
7 | 12045266215224 |
oct | 1652134356730 |
9 | 401017516340 |
10 | 125920468440 |
11 | 49447904748 |
12 | 204a2615560 |
13 | bb49958030 |
14 | 6147771784 |
15 | 341eb2d660 |
hex | 1d5171ddd8 |
125920468440 has 192 divisors, whose sum is σ = 442666879200. Its totient is φ = 30859001856.
The previous prime is 125920468439. The next prime is 125920468493. The reversal of 125920468440 is 44864029521.
It is a happy number.
125920468440 is a `hidden beast` number, since 12 + 592 + 0 + 4 + 6 + 8 + 4 + 40 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1003096 + ... + 1121624.
Almost surely, 2125920468440 is an apocalyptic number.
125920468440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 125920468440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (221333439600).
125920468440 is an abundant number, since it is smaller than the sum of its proper divisors (316746410760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125920468440 is a wasteful number, since it uses less digits than its factorization.
125920468440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118786 (or 118779 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 45.
The spelling of 125920468440 in words is "one hundred twenty-five billion, nine hundred twenty million, four hundred sixty-eight thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •