Base | Representation |
---|---|
bin | 10100100000101111… |
… | …11010001001111010 |
3 | 1001102110020201102010 |
4 | 22100113322021322 |
5 | 140023100334320 |
6 | 5020415550350 |
7 | 536614325436 |
oct | 122027721172 |
9 | 31373221363 |
10 | 11012121210 |
11 | 4741067722 |
12 | 2173b2b3b6 |
13 | 10665ac86c |
14 | 7667479c6 |
15 | 446b85ae0 |
hex | 2905fa27a |
11012121210 has 16 divisors (see below), whose sum is σ = 26429090976. Its totient is φ = 2936565648.
The previous prime is 11012121199. The next prime is 11012121221. The reversal of 11012121210 is 1212121011.
11012121210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11012121199) and next prime (11012121221).
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 7 ways as a sum of consecutive naturals, for example, 183535324 + ... + 183535383.
It is an arithmetic number, because the mean of its divisors is an integer number (1651818186).
Almost surely, 211012121210 is an apocalyptic number.
11012121210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11012121210 is an abundant number, since it is smaller than the sum of its proper divisors (15416969766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012121210 is a wasteful number, since it uses less digits than its factorization.
11012121210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367070717.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11012121210 its reverse (1212121011), we get a palindrome (12224242221).
The spelling of 11012121210 in words is "eleven billion, twelve million, one hundred twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •