Base | Representation |
---|---|
bin | 111010110110010100… |
… | …1000010110110100100 |
3 | 110002012102011002200220 |
4 | 1311230221002312210 |
5 | 4032304422004000 |
6 | 134020124204340 |
7 | 12062506440510 |
oct | 1655451026644 |
9 | 402172132626 |
10 | 126376750500 |
11 | 49661421160 |
12 | 205ab3996b0 |
13 | bbc0344210 |
14 | 618c1c7140 |
15 | 3449c0d1a0 |
hex | 1d6ca42da4 |
126376750500 has 768 divisors, whose sum is σ = 523281088512. Its totient is φ = 22809600000.
The previous prime is 126376750481. The next prime is 126376750541. The reversal of 126376750500 is 5057673621.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 25523025 + ... + 25527975.
It is an arithmetic number, because the mean of its divisors is an integer number (681355584).
Almost surely, 2126376750500 is an apocalyptic number.
126376750500 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 126376750500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (261640544256).
126376750500 is an abundant number, since it is smaller than the sum of its proper divisors (396904338012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126376750500 is a wasteful number, since it uses less digits than its factorization.
126376750500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5021 (or 5009 counting only the distinct ones).
The product of its (nonzero) digits is 264600, while the sum is 42.
The spelling of 126376750500 in words is "one hundred twenty-six billion, three hundred seventy-six million, seven hundred fifty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •