| Base | Representation |
|---|---|
| bin | 10100011111010100… |
| … | …11110011001000100 |
| 3 | 1001101121211121200200 |
| 4 | 22033222132121010 |
| 5 | 140012023223022 |
| 6 | 5015312410500 |
| 7 | 536411152020 |
| oct | 121752363104 |
| 9 | 31347747620 |
| 10 | 11000211012 |
| 11 | 473537238a |
| 12 | 216bb46a30 |
| 13 | 1063c9c6cb |
| 14 | 764d27380 |
| 15 | 445ad1bac |
| hex | 28fa9e644 |
11000211012 has 144 divisors (see below), whose sum is σ = 35110962432. Its totient is φ = 2829404160.
The previous prime is 11000210971. The next prime is 11000211017. The reversal of 11000211012 is 21011200011.
It is a happy number.
11000211012 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 = 11000210985 and 11000211003.
It is not an unprimeable number, because it can be changed into a prime (11000211017) 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 47 ways as a sum of consecutive naturals, for example, 42712 + ... + 154352.
It is an arithmetic number, because the mean of its divisors is an integer number (243826128).
Almost surely, 211000211012 is an apocalyptic number.
11000211012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11000211012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17555481216).
11000211012 is an abundant number, since it is smaller than the sum of its proper divisors (24110751420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000211012 is a wasteful number, since it uses less digits than its factorization.
11000211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111698 (or 111693 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11000211012 its reverse (21011200011), we get a palindrome (32011411023).
The spelling of 11000211012 in words is "eleven billion, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •