Base | Representation |
---|---|
bin | 1010000000111111101001… |
… | …0101110110100011001101 |
3 | 1102222202102020101110210012 |
4 | 2200033322111312203031 |
5 | 2420410442002241414 |
6 | 35230534013523005 |
7 | 2214414416603306 |
oct | 240177225664315 |
9 | 42882366343705 |
10 | 11012201212109 |
11 | 3566280551189 |
12 | 129a2a3aa3465 |
13 | 61b5a51787a6 |
14 | 2a0dc9bad7ad |
15 | 1416bc92333e |
hex | a03fa5768cd |
11012201212109 has 2 divisors, whose sum is σ = 11012201212110. Its totient is φ = 11012201212108.
The previous prime is 11012201212093. The next prime is 11012201212123. The reversal of 11012201212109 is 90121210221011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10718846821225 + 293354390884 = 3273965^2 + 541622^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012201212109 - 24 = 11012201212093 is a prime.
It is a super-4 number, since 4×110122012121094 (a number of 53 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012201212169) 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 as a sum of consecutive naturals, namely, 5506100606054 + 5506100606055.
It is an arithmetic number, because the mean of its divisors is an integer number (5506100606055).
Almost surely, 211012201212109 is an apocalyptic number.
It is an amenable number.
11012201212109 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012201212109 is an equidigital number, since it uses as much as digits as its factorization.
11012201212109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 11012201212109 in words is "eleven trillion, twelve billion, two hundred one million, two hundred twelve thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •