Base | Representation |
---|---|
bin | 10000010101000011000… |
… | …010001001110001001111 |
3 | 10222021100212000010112121 |
4 | 100111003002021301033 |
5 | 121341040420231111 |
6 | 2215253555113411 |
7 | 144032646664603 |
oct | 20250302116117 |
9 | 3867325003477 |
10 | 1122111102031 |
11 | 3a2980511237 |
12 | 1615808a2867 |
13 | 81a7895a0ba |
14 | 3c44bcc9503 |
15 | 1e2c6c28871 |
hex | 10543089c4f |
1122111102031 has 16 divisors (see below), whose sum is σ = 1133129245248. Its totient is φ = 1111149964800.
The previous prime is 1122111102029. The next prime is 1122111102067. The reversal of 1122111102031 is 1302011112211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1122111102031 - 21 = 1122111102029 is a prime.
It is a super-2 number, since 2×11221111020312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1122111101996 and 1122111102014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122111102731) 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, 138853911 + ... + 138861991.
It is an arithmetic number, because the mean of its divisors is an integer number (70820577828).
Almost surely, 21122111102031 is an apocalyptic number.
1122111102031 is a deficient number, since it is larger than the sum of its proper divisors (11018143217).
1122111102031 is a wasteful number, since it uses less digits than its factorization.
1122111102031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11442.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 1122111102031 its reverse (1302011112211), we get a palindrome (2424122214242).
The spelling of 1122111102031 in words is "one trillion, one hundred twenty-two billion, one hundred eleven million, one hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •