Base | Representation |
---|---|
bin | 10010110101001101… |
… | …01000011001111010 |
3 | 222002120202202211221 |
4 | 21122212220121322 |
5 | 131201130323002 |
6 | 4351112342254 |
7 | 505351450510 |
oct | 113246503172 |
9 | 28076682757 |
10 | 10110011002 |
11 | 43189239a3 |
12 | 1b619a498a |
13 | c51727840 |
14 | 6bc9dc4b0 |
15 | 3e288dc37 |
hex | 25a9a867a |
10110011002 has 16 divisors (see below), whose sum is σ = 18664636032. Its totient is φ = 3999564720.
The previous prime is 10110010987. The next prime is 10110011033. The reversal of 10110011002 is 20011001101.
10110011002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×101100110022 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (7).
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 7 ways as a sum of consecutive naturals, for example, 27774574 + ... + 27774937.
It is an arithmetic number, because the mean of its divisors is an integer number (1166539752).
Almost surely, 210110011002 is an apocalyptic number.
10110011002 is a deficient number, since it is larger than the sum of its proper divisors (8554625030).
10110011002 is a wasteful number, since it uses less digits than its factorization.
10110011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55549533.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 10110011002 its reverse (20011001101), we get a palindrome (30121012103).
Subtracting 10110011002 from its reverse (20011001101), we obtain a palindrome (9900990099).
The spelling of 10110011002 in words is "ten billion, one hundred ten million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •