Base | Representation |
---|---|
bin | 1010001100101000011001… |
… | …1111010111000000100011 |
3 | 1110200212102222202110221221 |
4 | 2203022012133113000203 |
5 | 2432144410434311321 |
6 | 35502435520555511 |
7 | 2235022545053452 |
oct | 243120637270043 |
9 | 43625388673857 |
10 | 11212121010211 |
11 | 3633041013520 |
12 | 1310b98782b97 |
13 | 6343b5996704 |
14 | 2aa953374b99 |
15 | 1469bdd03e41 |
hex | a32867d7023 |
11212121010211 has 16 divisors (see below), whose sum is σ = 12378959094528. Its totient is φ = 10070307532000.
The previous prime is 11212121010157. The next prime is 11212121010227. The reversal of 11212121010211 is 11201012121211.
It is a cyclic number.
It is not a de Polignac number, because 11212121010211 - 211 = 11212121008163 is a prime.
It is a super-2 number, since 2×112121210102112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11212121010271) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10286215 + ... + 11323888.
It is an arithmetic number, because the mean of its divisors is an integer number (773684943408).
Almost surely, 211212121010211 is an apocalyptic number.
11212121010211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11212121010211 is a deficient number, since it is larger than the sum of its proper divisors (1166838084317).
11212121010211 is a wasteful number, since it uses less digits than its factorization.
11212121010211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21610682.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11212121010211 its reverse (11201012121211), we get a palindrome (22413133131422).
The spelling of 11212121010211 in words is "eleven trillion, two hundred twelve billion, one hundred twenty-one million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •