Base | Representation |
---|---|
bin | 10010110100000001… |
… | …10111011010101110 |
3 | 222001220010210122000 |
4 | 21122000313122232 |
5 | 131141112023042 |
6 | 4350120233130 |
7 | 505201345551 |
oct | 113200673256 |
9 | 28056123560 |
10 | 10100111022 |
11 | 43132819a1 |
12 | 1b5a60b7a6 |
13 | c4c66c671 |
14 | 6bb582698 |
15 | 3e1a8574c |
hex | 25a0376ae |
10100111022 has 16 divisors (see below), whose sum is σ = 22444691280. Its totient is φ = 3366703656.
The previous prime is 10100110997. The next prime is 10100111059. The reversal of 10100111022 is 22011100101.
It is a happy number.
10100111022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 = 10100110995 and 10100111013.
It is a congruent number.
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, 93519493 + ... + 93519600.
It is an arithmetic number, because the mean of its divisors is an integer number (1402793205).
Almost surely, 210100111022 is an apocalyptic number.
10100111022 is an abundant number, since it is smaller than the sum of its proper divisors (12344580258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100111022 is a wasteful number, since it uses less digits than its factorization.
10100111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187039104 (or 187039098 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10100111022 its reverse (22011100101), we get a palindrome (32111211123).
The spelling of 10100111022 in words is "ten billion, one hundred million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •