Base | Representation |
---|---|
bin | 11001010010001100111011… |
… | …110101101110100110101001 |
3 | 112120201210210201202020112011 |
4 | 121102030323311232212221 |
5 | 104033413200030413001 |
6 | 1032301254454315521 |
7 | 32265036164612365 |
oct | 3122147365564651 |
9 | 476653721666464 |
10 | 111202002201001 |
11 | 32483560237558 |
12 | 1057b839658ba1 |
13 | 4a083c462428a |
14 | 1d662c43382a5 |
15 | ccc945097d51 |
hex | 65233bd6e9a9 |
111202002201001 has 16 divisors (see below), whose sum is σ = 112008000158208. Its totient is φ = 110398519940800.
The previous prime is 111202002200969. The next prime is 111202002201007. The reversal of 111202002201001 is 100102200202111.
It is a cyclic number.
It is not a de Polignac number, because 111202002201001 - 25 = 111202002200969 is a prime.
It is a super-3 number, since 3×1112020022010013 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111202002201007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 592569456 + ... + 592757086.
It is an arithmetic number, because the mean of its divisors is an integer number (7000500009888).
Almost surely, 2111202002201001 is an apocalyptic number.
It is an amenable number.
111202002201001 is a deficient number, since it is larger than the sum of its proper divisors (805997957207).
111202002201001 is a wasteful number, since it uses less digits than its factorization.
111202002201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194312.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 111202002201001 its reverse (100102200202111), we get a palindrome (211304202403112).
The spelling of 111202002201001 in words is "one hundred eleven trillion, two hundred two billion, two million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •