Base | Representation |
---|---|
bin | 10000010011001011111… |
… | …111110110101111101001 |
3 | 10222002012200010101211022 |
4 | 100103023333312233221 |
5 | 121322443141323423 |
6 | 2214323454342225 |
7 | 143632320000236 |
oct | 20231377665751 |
9 | 3862180111738 |
10 | 1120114011113 |
11 | 3a2046181279 |
12 | 161103aba975 |
13 | 8181ac90bb6 |
14 | 3c2dc98a78d |
15 | 1e20b73cdc8 |
hex | 104cbff6be9 |
1120114011113 has 4 divisors (see below), whose sum is σ = 1120116401280. Its totient is φ = 1120111620948.
The previous prime is 1120114011103. The next prime is 1120114011119. The reversal of 1120114011113 is 3111104110211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1120114011113 - 24 = 1120114011097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1120114011091 and 1120114011100.
It is not an unprimeable number, because it can be changed into a prime (1120114011119) 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, 235073 + ... + 1515086.
It is an arithmetic number, because the mean of its divisors is an integer number (280029100320).
Almost surely, 21120114011113 is an apocalyptic number.
It is an amenable number.
1120114011113 is a deficient number, since it is larger than the sum of its proper divisors (2390167).
1120114011113 is an equidigital number, since it uses as much as digits as its factorization.
1120114011113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2390166.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 1120114011113 its reverse (3111104110211), we get a palindrome (4231218121324).
The spelling of 1120114011113 in words is "one trillion, one hundred twenty billion, one hundred fourteen million, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •