Base | Representation |
---|---|
bin | 1010000001011100101101… |
… | …0100010011010100100110 |
3 | 1110000111112220100021122010 |
4 | 2200113023110103110212 |
5 | 2421022431031223420 |
6 | 35234304044215050 |
7 | 2215111633156524 |
oct | 240271324232446 |
9 | 43014486307563 |
10 | 11020002211110 |
11 | 3569613a591a2 |
12 | 129b90053a486 |
13 | 61c2493c4229 |
14 | 2a1529c75314 |
15 | 1419c77104e0 |
hex | a05cb513526 |
11020002211110 has 32 divisors (see below), whose sum is σ = 26457907410432. Its totient is φ = 2937567022560.
The previous prime is 11020002211079. The next prime is 11020002211123. The reversal of 11020002211110 is 1111220002011.
It is a super-4 number, since 4×110200022111104 (a number of 53 digits) contains 4444 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68683144 + ... + 68843403.
It is an arithmetic number, because the mean of its divisors is an integer number (826809606576).
Almost surely, 211020002211110 is an apocalyptic number.
11020002211110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11020002211110 is an abundant number, since it is smaller than the sum of its proper divisors (15437905199322).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020002211110 is a wasteful number, since it uses less digits than its factorization.
11020002211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137529228.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11020002211110 its reverse (1111220002011), we get a palindrome (12131222213121).
The spelling of 11020002211110 in words is "eleven trillion, twenty billion, two million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •