Base | Representation |
---|---|
bin | 10000010011001011110… |
… | …100110010111101001101 |
3 | 10222002012110200010000020 |
4 | 100103023310302331031 |
5 | 121322441421041023 |
6 | 2214323312252353 |
7 | 143632253234115 |
oct | 20231364627515 |
9 | 3862173603006 |
10 | 1120111112013 |
11 | 3a2044581123 |
12 | 161102b410b9 |
13 | 8181a4b745a |
14 | 3c2dc434045 |
15 | 1e20b368de3 |
hex | 104cbd32f4d |
1120111112013 has 16 divisors (see below), whose sum is σ = 1558784373120. Its totient is φ = 714104667584.
The previous prime is 1120111111913. The next prime is 1120111112041. The reversal of 1120111112013 is 3102111110211.
It is a cyclic number.
It is not a de Polignac number, because 1120111112013 - 29 = 1120111111501 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1120111111983 and 1120111112001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120111112513) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1627506 + ... + 2211107.
It is an arithmetic number, because the mean of its divisors is an integer number (97424023320).
Almost surely, 21120111112013 is an apocalyptic number.
It is an amenable number.
1120111112013 is a deficient number, since it is larger than the sum of its proper divisors (438673261107).
1120111112013 is a wasteful number, since it uses less digits than its factorization.
1120111112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3842868.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 1120111112013 its reverse (3102111110211), we get a palindrome (4222222222224).
The spelling of 1120111112013 in words is "one trillion, one hundred twenty billion, one hundred eleven million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •