Base | Representation |
---|---|
bin | 10010110101000101… |
… | …10010010010100000 |
3 | 222002111212120000021 |
4 | 21122202302102200 |
5 | 131200401043122 |
6 | 4351035003224 |
7 | 505340051461 |
oct | 113242622240 |
9 | 28074776007 |
10 | 10109002912 |
11 | 43182a5568 |
12 | 1b61599514 |
13 | c51463a38 |
14 | 6bc818d68 |
15 | 3e27401c7 |
hex | 25a8b24a0 |
10109002912 has 48 divisors (see below), whose sum is σ = 20359255392. Its totient is φ = 4939168000.
The previous prime is 10109002909. The next prime is 10109002919. The reversal of 10109002912 is 21920090101.
It is a super-3 number, since 3×101090029123 (a number of 31 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (10109002919) 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, 413823 + ... + 437569.
It is an arithmetic number, because the mean of its divisors is an integer number (424151154).
Almost surely, 210109002912 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 10109002912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10179627696).
10109002912 is an abundant number, since it is smaller than the sum of its proper divisors (10250252480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10109002912 is a wasteful number, since it uses less digits than its factorization.
10109002912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24061 (or 24053 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 25.
The spelling of 10109002912 in words is "ten billion, one hundred nine million, two thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •