Base | Representation |
---|---|
bin | 10000010011001011111… |
… | …000100111001001001101 |
3 | 10222002012112112221000101 |
4 | 100103023320213021031 |
5 | 121322442200042310 |
6 | 2214323345531101 |
7 | 143632264601122 |
oct | 20231370471115 |
9 | 3862175487011 |
10 | 1120112112205 |
11 | 3a20450a4629 |
12 | 161103343a91 |
13 | 8181a777798 |
14 | 3c2dc614749 |
15 | 1e20b4b543a |
hex | 104cbe2724d |
1120112112205 has 8 divisors (see below), whose sum is σ = 1344402801504. Its totient is φ = 895910845200.
The previous prime is 1120112112181. The next prime is 1120112112263. The reversal of 1120112112205 is 5022112110211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1120112112205 - 223 = 1120103723597 is a prime.
It is a super-2 number, since 2×11201121122052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22328011 + ... + 22378120.
It is an arithmetic number, because the mean of its divisors is an integer number (168050350188).
Almost surely, 21120112112205 is an apocalyptic number.
It is an amenable number.
1120112112205 is a deficient number, since it is larger than the sum of its proper divisors (224290689299).
1120112112205 is an equidigital number, since it uses as much as digits as its factorization.
1120112112205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44711147.
The product of its (nonzero) digits is 80, while the sum is 19.
Adding to 1120112112205 its reverse (5022112110211), we get a palindrome (6142224222416).
The spelling of 1120112112205 in words is "one trillion, one hundred twenty billion, one hundred twelve million, one hundred twelve thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •