Base | Representation |
---|---|
bin | 111010011101110011… |
… | …1011010101000000000 |
3 | 110000002002110020102001 |
4 | 1310323213122220000 |
5 | 4024113341140000 |
6 | 133402343033344 |
7 | 12033231300640 |
oct | 1647347325000 |
9 | 400062406361 |
10 | 125554240000 |
11 | 4927a105912 |
12 | 203bba3b854 |
13 | babbb0c307 |
14 | 6110c7c520 |
15 | 33ec8db46a |
hex | 1d3b9daa00 |
125554240000 has 400 divisors, whose sum is σ = 373991384448. Its totient is φ = 41158656000.
The previous prime is 125554239991. The next prime is 125554240013. The reversal of 125554240000 is 42455521.
It is a tau number, because it is divible by the number of its divisors (400).
It is a Harshad number since it is a multiple of its sum of digits (28).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 51518782 + ... + 51521218.
Almost surely, 2125554240000 is an apocalyptic number.
125554240000 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 125554240000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (186995692224).
125554240000 is an abundant number, since it is smaller than the sum of its proper divisors (248437144448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125554240000 is an frugal number, since it uses more digits than its factorization.
125554240000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2505 (or 2474 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 28.
Adding to 125554240000 its reverse (42455521), we get a palindrome (125596695521).
The spelling of 125554240000 in words is "one hundred twenty-five billion, five hundred fifty-four million, two hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •