Base | Representation |
---|---|
bin | 1010001011111110111110… |
… | …1000011100111100011001 |
3 | 1110122210201221210200120002 |
4 | 2202333233220130330121 |
5 | 2432004122011141414 |
6 | 35453400213142345 |
7 | 2234150136634535 |
oct | 242775750347431 |
9 | 43583657720502 |
10 | 11201000099609 |
11 | 3629354601811 |
12 | 130a9b432a9b5 |
13 | 6333329b6838 |
14 | 2aa1ba3ccbc5 |
15 | 14656c82e4de |
hex | a2fefa1cf19 |
11201000099609 has 2 divisors, whose sum is σ = 11201000099610. Its totient is φ = 11201000099608.
The previous prime is 11201000099579. The next prime is 11201000099647. The reversal of 11201000099609 is 90699000010211.
It is an a-pointer prime, because the next prime (11201000099647) can be obtained adding 11201000099609 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7968357917584 + 3232642182025 = 2822828^2 + 1797955^2 .
It is an emirp because it is prime and its reverse (90699000010211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11201000099609 - 28 = 11201000099353 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11201000099669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600500049804 + 5600500049805.
It is an arithmetic number, because the mean of its divisors is an integer number (5600500049805).
Almost surely, 211201000099609 is an apocalyptic number.
It is an amenable number.
11201000099609 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201000099609 is an equidigital number, since it uses as much as digits as its factorization.
11201000099609 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 38.
The spelling of 11201000099609 in words is "eleven trillion, two hundred one billion, ninety-nine thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •