Base | Representation |
---|---|
bin | 10010111011101110… |
… | …10011111000000000 |
3 | 222020101201000122020 |
4 | 21131313103320000 |
5 | 131304131340013 |
6 | 4400345041440 |
7 | 506614436430 |
oct | 113567237000 |
9 | 28211630566 |
10 | 10164715008 |
11 | 4346797918 |
12 | 1b78186280 |
13 | c5cb6c086 |
14 | 6c5d9c2c0 |
15 | 3e7597623 |
hex | 25ddd3e00 |
10164715008 has 160 divisors (see below), whose sum is σ = 31013300736. Its totient is φ = 2898075648.
The previous prime is 10164714971. The next prime is 10164715049. The reversal of 10164715008 is 80051746101.
It is a happy number.
10164715008 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 10164715008.
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, 8310685 + ... + 8311907.
Almost surely, 210164715008 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 10164715008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15506650368).
10164715008 is an abundant number, since it is smaller than the sum of its proper divisors (20848585728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10164715008 is an equidigital number, since it uses as much as digits as its factorization.
10164715008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2024 (or 2008 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 33.
The spelling of 10164715008 in words is "ten billion, one hundred sixty-four million, seven hundred fifteen thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •