Base | Representation |
---|---|
bin | 10000001001111000010… |
… | …111111110000111010110 |
3 | 10221010102020201112022120 |
4 | 100021320113332013112 |
5 | 121142012001041042 |
6 | 2205552124040410 |
7 | 143126556521526 |
oct | 20117027760726 |
9 | 3833366645276 |
10 | 1110121112022 |
11 | 39888847728a |
12 | 15b195393106 |
13 | 808b78bb860 |
14 | 3ba31755686 |
15 | 1dd242d3dec |
hex | 102785fe1d6 |
1110121112022 has 128 divisors (see below), whose sum is σ = 2455245112320. Its totient is φ = 332563345920.
The previous prime is 1110121112017. The next prime is 1110121112077. The reversal of 1110121112022 is 2202111210111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1110121111992 and 1110121112010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 114712648 + ... + 114722324.
It is an arithmetic number, because the mean of its divisors is an integer number (19181602440).
Almost surely, 21110121112022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1110121112022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1227622556160).
1110121112022 is an abundant number, since it is smaller than the sum of its proper divisors (1345124000298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110121112022 is a wasteful number, since it uses less digits than its factorization.
1110121112022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10038.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1110121112022 its reverse (2202111210111), we get a palindrome (3312232322133).
The spelling of 1110121112022 in words is "one trillion, one hundred ten billion, one hundred twenty-one million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •