Base | Representation |
---|---|
bin | 10000001001111000011… |
… | …011101111010110011001 |
3 | 10221010102022120201201211 |
4 | 100021320123233112121 |
5 | 121142012224200441 |
6 | 2205552201143121 |
7 | 143126601105346 |
oct | 20117033572631 |
9 | 3833368521654 |
10 | 1110122100121 |
11 | 398888a916a1 |
12 | 15b19578aaa1 |
13 | 808b7b76528 |
14 | 3ba319317cd |
15 | 1dd2442ba81 |
hex | 102786ef599 |
1110122100121 has 4 divisors (see below), whose sum is σ = 1110124498212. Its totient is φ = 1110119702032.
The previous prime is 1110122100089. The next prime is 1110122100149. The reversal of 1110122100121 is 1210012210111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 190126521225 + 919995578896 = 436035^2 + 959164^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110122100121 - 25 = 1110122100089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1110162100121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 259006 + ... + 1512391.
It is an arithmetic number, because the mean of its divisors is an integer number (277531124553).
Almost surely, 21110122100121 is an apocalyptic number.
It is an amenable number.
1110122100121 is a deficient number, since it is larger than the sum of its proper divisors (2398091).
1110122100121 is an equidigital number, since it uses as much as digits as its factorization.
1110122100121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2398090.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1110122100121 its reverse (1210012210111), we get a palindrome (2320134310232).
The spelling of 1110122100121 in words is "one trillion, one hundred ten billion, one hundred twenty-two million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •