Base | Representation |
---|---|
bin | 10100101011001110… |
… | …01011011000011100 |
3 | 1001122120121221011221 |
4 | 22111213023120130 |
5 | 140213100310022 |
6 | 5033235423124 |
7 | 542032346140 |
oct | 122547133034 |
9 | 31576557157 |
10 | 11100010012 |
11 | 47867368a3 |
12 | 2199454aa4 |
13 | 107b872880 |
14 | 7742a5220 |
15 | 44e746cc7 |
hex | 2959cb61c |
11100010012 has 48 divisors (see below), whose sum is σ = 23919636160. Its totient is φ = 4389023232.
The previous prime is 11100009979. The next prime is 11100010087. The reversal of 11100010012 is 21001000111.
11100010012 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 (7).
It is a junction number, because it is equal to n+sod(n) for n = 11100009977 and 11100010004.
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 15 ways as a sum of consecutive naturals, for example, 858814 + ... + 871642.
Almost surely, 211100010012 is an apocalyptic number.
It is an amenable number.
11100010012 is an abundant number, since it is smaller than the sum of its proper divisors (12819626148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100010012 is a wasteful number, since it uses less digits than its factorization.
11100010012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15230 (or 15228 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11100010012 its reverse (21001000111), we get a palindrome (32101010123).
Subtracting 11100010012 from its reverse (21001000111), we obtain a palindrome (9900990099).
The spelling of 11100010012 in words is "eleven billion, one hundred million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •