Base | Representation |
---|---|
bin | 10010110101010101… |
… | …10100111111000000 |
3 | 222002122211122220110 |
4 | 21122222310333000 |
5 | 131201421023404 |
6 | 4351152111320 |
7 | 505364012013 |
oct | 113252647700 |
9 | 28078748813 |
10 | 10111111104 |
11 | 4319505476 |
12 | 1b62235540 |
13 | c51a214a3 |
14 | 6bcc0737a |
15 | 3e2a09b89 |
hex | 25aab4fc0 |
10111111104 has 28 divisors (see below), whose sum is σ = 26752315304. Its totient is φ = 3370370304.
The previous prime is 10111111103. The next prime is 10111111159. The reversal of 10111111104 is 40111111101.
10111111104 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 (12).
It is a self number, because there is not a number n which added to its sum of digits gives 10111111104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111111103) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 26330827 + ... + 26331210.
Almost surely, 210111111104 is an apocalyptic number.
It is an amenable number.
10111111104 is an abundant number, since it is smaller than the sum of its proper divisors (16641204200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111111104 is an equidigital number, since it uses as much as digits as its factorization.
10111111104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52662052 (or 52662042 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10111111104 its reverse (40111111101), we get a palindrome (50222222205).
The spelling of 10111111104 in words is "ten billion, one hundred eleven million, one hundred eleven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •