Base | Representation |
---|---|
bin | 101110100111100010… |
… | …1001111011110111010 |
3 | 100120101220112211211000 |
4 | 1131033011033132322 |
5 | 3120011410201020 |
6 | 113553530345430 |
7 | 10142562434556 |
oct | 1351705173672 |
9 | 316356484730 |
10 | 100111022010 |
11 | 3950307562a |
12 | 1749ab8b276 |
13 | 959581203c |
14 | 4bb9ac0866 |
15 | 290dd6a090 |
hex | 174f14f7ba |
100111022010 has 64 divisors (see below), whose sum is σ = 269554671360. Its totient is φ = 26437078080.
The previous prime is 100111022009. The next prime is 100111022027. The reversal of 100111022010 is 10220111001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100111021983 and 100111022001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1772101 + ... + 1827720.
It is an arithmetic number, because the mean of its divisors is an integer number (4211791740).
Almost surely, 2100111022010 is an apocalyptic number.
100111022010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100111022010 is an abundant number, since it is smaller than the sum of its proper divisors (169443649350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100111022010 is a wasteful number, since it uses less digits than its factorization.
100111022010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3599940 (or 3599934 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100111022010 its reverse (10220111001), we get a palindrome (110331133011).
The spelling of 100111022010 in words is "one hundred billion, one hundred eleven million, twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •