Base | Representation |
---|---|
bin | 10000010101000011000… |
… | …101100111101101011101 |
3 | 10222021100220201022112212 |
4 | 100111003011213231131 |
5 | 121341041133323401 |
6 | 2215254030410205 |
7 | 144032660502134 |
oct | 20250305475535 |
9 | 3867326638485 |
10 | 1122112011101 |
11 | 3a2980a82234 |
12 | 161581060965 |
13 | 81a78bb7b03 |
14 | 3c44c08491b |
15 | 1e2c6d57dbb |
hex | 10543167b5d |
1122112011101 has 8 divisors (see below), whose sum is σ = 1124466444504. Its totient is φ = 1119759726400.
The previous prime is 1122112011091. The next prime is 1122112011109. The reversal of 1122112011101 is 1011102112211.
It can be written as a sum of positive squares in 4 ways, for example, as 554914745476 + 567197265625 = 744926^2 + 753125^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1122112011101 - 26 = 1122112011037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122112011109) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 510515 + ... + 1582671.
It is an arithmetic number, because the mean of its divisors is an integer number (140558305563).
Almost surely, 21122112011101 is an apocalyptic number.
It is an amenable number.
1122112011101 is a deficient number, since it is larger than the sum of its proper divisors (2354433403).
1122112011101 is a wasteful number, since it uses less digits than its factorization.
1122112011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1074351.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1122112011101 its reverse (1011102112211), we get a palindrome (2133214123312).
The spelling of 1122112011101 in words is "one trillion, one hundred twenty-two billion, one hundred twelve million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •