Base | Representation |
---|---|
bin | 10010110000010000… |
… | …01010110110000000 |
3 | 221222200121022220120 |
4 | 21120020022312000 |
5 | 131110012034133 |
6 | 4343030140240 |
7 | 504335410230 |
oct | 113010126600 |
9 | 27880538816 |
10 | 10068471168 |
11 | 42a7431458 |
12 | 1b4bab1680 |
13 | c45c42162 |
14 | 6b72a7cc0 |
15 | 3dddd5ab3 |
hex | 25820ad80 |
10068471168 has 256 divisors, whose sum is σ = 32137344000. Its totient is φ = 2730663936.
The previous prime is 10068471151. The next prime is 10068471211. The reversal of 10068471168 is 86117486001.
It is a super-2 number, since 2×100684711682 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9211230 + ... + 9212322.
It is an arithmetic number, because the mean of its divisors is an integer number (125536500).
Almost surely, 210068471168 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 10068471168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16068672000).
10068471168 is an abundant number, since it is smaller than the sum of its proper divisors (22068872832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10068471168 is a wasteful number, since it uses less digits than its factorization.
10068471168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1289 (or 1277 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 42.
The spelling of 10068471168 in words is "ten billion, sixty-eight million, four hundred seventy-one thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •