Base | Representation |
---|---|
bin | 10000001001111000011… |
… | …011101111100100011101 |
3 | 10221010102022120202222011 |
4 | 100021320123233210131 |
5 | 121142012224213041 |
6 | 2205552201151221 |
7 | 143126601111103 |
oct | 20117033574435 |
9 | 3833368522864 |
10 | 1110122101021 |
11 | 398888a9233a |
12 | 15b19578b511 |
13 | 808b7b76a6b |
14 | 3ba31931c73 |
15 | 1dd2442be81 |
hex | 102786ef91d |
1110122101021 has 8 divisors (see below), whose sum is σ = 1175109202080. Its totient is φ = 1046915468592.
The previous prime is 1110122101009. The next prime is 1110122101043. The reversal of 1110122101021 is 1201012210111.
It is a happy number.
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 1110122101021 - 213 = 1110122092829 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110122100992 and 1110122101010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110122101091) 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, 445115875 + ... + 445118368.
It is an arithmetic number, because the mean of its divisors is an integer number (146888650260).
Almost surely, 21110122101021 is an apocalyptic number.
It is an amenable number.
1110122101021 is a deficient number, since it is larger than the sum of its proper divisors (64987101059).
1110122101021 is an equidigital number, since it uses as much as digits as its factorization.
1110122101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890234315.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1110122101021 its reverse (1201012210111), we get a palindrome (2311134311132).
The spelling of 1110122101021 in words is "one trillion, one hundred ten billion, one hundred twenty-two million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •