Base | Representation |
---|---|
bin | 1010000000111011111010… |
… | …1110011011000100110011 |
3 | 1102222122211112100110102211 |
4 | 2200032332232123010303 |
5 | 2420401414430121321 |
6 | 35230250444152551 |
7 | 2214350553243040 |
oct | 240167656330463 |
9 | 42878745313384 |
10 | 11011201020211 |
11 | 3565907a07207 |
12 | 129a064b38757 |
13 | 61b475ba2172 |
14 | 2a0d330121c7 |
15 | 14165ec050e1 |
hex | a03beb9b133 |
11011201020211 has 16 divisors (see below), whose sum is σ = 12733204315648. Its totient is φ = 9327089088000.
The previous prime is 11011201020191. The next prime is 11011201020217. The reversal of 11011201020211 is 11202010211011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11011201020211 - 29 = 11011201019699 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11011201020191 and 11011201020200.
It is not an unprimeable number, because it can be changed into a prime (11011201020217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26784105 + ... + 27192106.
It is an arithmetic number, because the mean of its divisors is an integer number (795825269728).
Almost surely, 211011201020211 is an apocalyptic number.
11011201020211 is a deficient number, since it is larger than the sum of its proper divisors (1722003295437).
11011201020211 is a wasteful number, since it uses less digits than its factorization.
11011201020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53976562.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11011201020211 its reverse (11202010211011), we get a palindrome (22213211231222).
The spelling of 11011201020211 in words is "eleven trillion, eleven billion, two hundred one million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •