Base | Representation |
---|---|
bin | 10100011111010100… |
… | …11110011001000010 |
3 | 1001101121211121200121 |
4 | 22033222132121002 |
5 | 140012023223020 |
6 | 5015312410454 |
7 | 536411152015 |
oct | 121752363102 |
9 | 31347747617 |
10 | 11000211010 |
11 | 4735372388 |
12 | 216bb46a2a |
13 | 1063c9c6c9 |
14 | 764d2737c |
15 | 445ad1baa |
hex | 28fa9e642 |
11000211010 has 16 divisors (see below), whose sum is σ = 19819025856. Its totient is φ = 4395940848.
The previous prime is 11000210971. The next prime is 11000211017. The reversal of 11000211010 is 1011200011.
11000211010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11000210984 and 11000211002.
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 7 ways as a sum of consecutive naturals, for example, 506784 + ... + 528043.
It is an arithmetic number, because the mean of its divisors is an integer number (1238689116).
Almost surely, 211000211010 is an apocalyptic number.
11000211010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11000211010 is a deficient number, since it is larger than the sum of its proper divisors (8818814846).
11000211010 is a wasteful number, since it uses less digits than its factorization.
11000211010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1035897.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11000211010 its reverse (1011200011), we get a palindrome (12011411021).
The spelling of 11000211010 in words is "eleven billion, two hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •