Base | Representation |
---|---|
bin | 1010000110110000011100… |
… | …1100111010011000000011 |
3 | 1110100012221201100221212210 |
4 | 2201230013030322120003 |
5 | 2424021220003020344 |
6 | 35344225415353203 |
7 | 2224520632023231 |
oct | 241540714723003 |
9 | 43305851327783 |
10 | 11111201220099 |
11 | 35a4263469502 |
12 | 12b5512982803 |
13 | 627a21751886 |
14 | 2a5adc0c5951 |
15 | 144063e7ddb9 |
hex | a1b0733a603 |
11111201220099 has 32 divisors (see below), whose sum is σ = 14969785872384. Its totient is φ = 7330198674080.
The previous prime is 11111201220061. The next prime is 11111201220109. The reversal of 11111201220099 is 99002210211111.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11111201220099 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11111201220019) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 1757264152 + ... + 1757270474.
It is an arithmetic number, because the mean of its divisors is an integer number (467805808512).
Almost surely, 211111201220099 is an apocalyptic number.
11111201220099 is a deficient number, since it is larger than the sum of its proper divisors (3858584652285).
11111201220099 is a wasteful number, since it uses less digits than its factorization.
11111201220099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11567.
The product of its (nonzero) digits is 648, while the sum is 30.
The spelling of 11111201220099 in words is "eleven trillion, one hundred eleven billion, two hundred one million, two hundred twenty thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.005 sec. • engine limits •