Base | Representation |
---|---|
bin | 10010111100000000… |
… | …01110011100100000 |
3 | 222020120002202110212 |
4 | 21132000032130200 |
5 | 131310231131224 |
6 | 4400511113252 |
7 | 506643342131 |
oct | 113600163440 |
9 | 28216082425 |
10 | 10167052064 |
11 | 4348043774 |
12 | 1b78b12828 |
13 | c604a9a50 |
14 | 6c6409c88 |
15 | 3e78a9d0e |
hex | 25e00e720 |
10167052064 has 48 divisors (see below), whose sum is σ = 21564829440. Its totient is φ = 4690586880.
The previous prime is 10167052061. The next prime is 10167052099. The reversal of 10167052064 is 46025076101.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 10167052064.
It is not an unprimeable number, because it can be changed into a prime (10167052061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2007167 + ... + 2012225.
It is an arithmetic number, because the mean of its divisors is an integer number (449267280).
Almost surely, 210167052064 is an apocalyptic number.
It is an amenable number.
10167052064 is an abundant number, since it is smaller than the sum of its proper divisors (11397777376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10167052064 is a wasteful number, since it uses less digits than its factorization.
10167052064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9913 (or 9905 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 32.
The spelling of 10167052064 in words is "ten billion, one hundred sixty-seven million, fifty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •