Base | Representation |
---|---|
bin | 10100100000101000… |
… | …11011101101110101 |
3 | 1001102101112102121100 |
4 | 22100110123231311 |
5 | 140022332210401 |
6 | 5020344240313 |
7 | 536603512233 |
oct | 122024335565 |
9 | 31371472540 |
10 | 11011210101 |
11 | 47405a5141 |
12 | 2173770099 |
13 | 1066350c48 |
14 | 76658b953 |
15 | 446a55b86 |
hex | 29051bb75 |
11011210101 has 48 divisors (see below), whose sum is σ = 16649870848. Its totient is φ = 7005398400.
The previous prime is 11011210099. The next prime is 11011210117. The reversal of 11011210101 is 10101211011.
11011210101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11011210101 - 21 = 11011210099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011210181) 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, 11110716 + ... + 11111706.
Almost surely, 211011210101 is an apocalyptic number.
It is an amenable number.
11011210101 is a deficient number, since it is larger than the sum of its proper divisors (5638660747).
11011210101 is a wasteful number, since it uses less digits than its factorization.
11011210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1642 (or 1639 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11011210101 its reverse (10101211011), we get a palindrome (21112421112).
The spelling of 11011210101 in words is "eleven billion, eleven million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •