Base | Representation |
---|---|
bin | 1010000110101111101111… |
… | …1000000011000001001110 |
3 | 1110100012110110210222211011 |
4 | 2201223323320003001032 |
5 | 2424020322331413402 |
6 | 35344154510515434 |
7 | 2224513133626051 |
oct | 241537370030116 |
9 | 43305413728734 |
10 | 11111011201102 |
11 | 35a417618340a |
12 | 12b547b205b7a |
13 | 6279c12805b7 |
14 | 2a5ac0b80a98 |
15 | 144052446ed7 |
hex | a1afbe0304e |
11111011201102 has 16 divisors (see below), whose sum is σ = 16676680196592. Its totient is φ = 5552118031680.
The previous prime is 11111011201097. The next prime is 11111011201133. The reversal of 11111011201102 is 20110211011111.
It is a super-2 number, since 2×111110112011022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 195391858 + ... + 195448714.
It is an arithmetic number, because the mean of its divisors is an integer number (1042292512287).
Almost surely, 211111011201102 is an apocalyptic number.
11111011201102 is a deficient number, since it is larger than the sum of its proper divisors (5565668995490).
11111011201102 is a wasteful number, since it uses less digits than its factorization.
11111011201102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114723.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11111011201102 its reverse (20110211011111), we get a palindrome (31221222212213).
The spelling of 11111011201102 in words is "eleven trillion, one hundred eleven billion, eleven million, two hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •