Base | Representation |
---|---|
bin | 10000001001110001001… |
… | …010101110110110100001 |
3 | 10221010002211012121202001 |
4 | 100021301022232312201 |
5 | 121141240022413441 |
6 | 2205532124324001 |
7 | 143123561014600 |
oct | 20116112566641 |
9 | 3833084177661 |
10 | 1110000201121 |
11 | 3988261a3119 |
12 | 15b1609a3601 |
13 | 80898836146 |
14 | 3ba1d67da37 |
15 | 1dd1889d731 |
hex | 102712aeda1 |
1110000201121 has 6 divisors (see below), whose sum is σ = 1291224723810. Its totient is φ = 951428743776.
The previous prime is 1110000201119. The next prime is 1110000201137. The reversal of 1110000201121 is 1211020000111.
It can be written as a sum of positive squares in only one way, i.e., 565413763600 + 544586437521 = 751940^2 + 737961^2 .
It is not a de Polignac number, because 1110000201121 - 21 = 1110000201119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1110000201098 and 1110000201107.
It is not an unprimeable number, because it can be changed into a prime (1110000204121) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11326532616 + ... + 11326532713.
It is an arithmetic number, because the mean of its divisors is an integer number (215204120635).
Almost surely, 21110000201121 is an apocalyptic number.
It is an amenable number.
1110000201121 is a deficient number, since it is larger than the sum of its proper divisors (181224522689).
1110000201121 is an equidigital number, since it uses as much as digits as its factorization.
1110000201121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22653065343 (or 22653065336 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1110000201121 its reverse (1211020000111), we get a palindrome (2321020201232).
The spelling of 1110000201121 in words is "one trillion, one hundred ten billion, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •