Base | Representation |
---|---|
bin | 10010110111110010… |
… | …10010000100111100 |
3 | 222011002112112200211 |
4 | 21123321102010330 |
5 | 131222202140000 |
6 | 4353205002204 |
7 | 506033560240 |
oct | 113371220474 |
9 | 28132475624 |
10 | 10131677500 |
11 | 432a08229a |
12 | 1b690b3364 |
13 | c56072659 |
14 | 6c183c420 |
15 | 3e471d7ba |
hex | 25be5213c |
10131677500 has 120 divisors (see below), whose sum is σ = 25393471488. Its totient is φ = 3463800000.
The previous prime is 10131677447. The next prime is 10131677513. The reversal of 10131677500 is 577613101.
10131677500 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 39 ways as a sum of consecutive naturals, for example, 8801925 + ... + 8803075.
Almost surely, 210131677500 is an apocalyptic number.
10131677500 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 10131677500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12696735744).
10131677500 is an abundant number, since it is smaller than the sum of its proper divisors (15261793988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131677500 is a wasteful number, since it uses less digits than its factorization.
10131677500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1685 (or 1668 counting only the distinct ones).
The product of its (nonzero) digits is 4410, while the sum is 31.
The spelling of 10131677500 in words is "ten billion, one hundred thirty-one million, six hundred seventy-seven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •