Base | Representation |
---|---|
bin | 10010110100111011… |
… | …10100011101010000 |
3 | 222002102102102012222 |
4 | 21122131310131100 |
5 | 131200032413242 |
6 | 4350551040212 |
7 | 505323020150 |
oct | 113235643520 |
9 | 28072372188 |
10 | 10107701072 |
11 | 4317596467 |
12 | 1b61070068 |
13 | c510c9311 |
14 | 6bc59a760 |
15 | 3e25845d2 |
hex | 25a774750 |
10107701072 has 80 divisors (see below), whose sum is σ = 23573348352. Its totient is φ = 4104693120.
The previous prime is 10107701069. The next prime is 10107701081. The reversal of 10107701072 is 27010770101.
10107701072 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 15 ways as a sum of consecutive naturals, for example, 257297 + ... + 293967.
Almost surely, 210107701072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10107701072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11786674176).
10107701072 is an abundant number, since it is smaller than the sum of its proper divisors (13465647280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10107701072 is a wasteful number, since it uses less digits than its factorization.
10107701072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36816 (or 36810 counting only the distinct ones).
The product of its (nonzero) digits is 686, while the sum is 26.
The spelling of 10107701072 in words is "ten billion, one hundred seven million, seven hundred one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •