Base | Representation |
---|---|
bin | 10000010011001100010… |
… | …110101111100100000011 |
3 | 10222002020002102020010202 |
4 | 100103030112233210003 |
5 | 121323001210323021 |
6 | 2214324231115415 |
7 | 143632421666531 |
oct | 20231426574403 |
9 | 3862202366122 |
10 | 1120120011011 |
11 | 3a20495aa071 |
12 | 161105b12b6b |
13 | 8181c2b1b31 |
14 | 3c2dd6ad151 |
15 | 1e20c025a0b |
hex | 104cc5af903 |
1120120011011 has 8 divisors (see below), whose sum is σ = 1162243868544. Its totient is φ = 1078370588160.
The previous prime is 1120120010981. The next prime is 1120120011013. The reversal of 1120120011011 is 1101100210211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1120120011011 - 214 = 1120119994627 is a prime.
It is a super-2 number, since 2×11201200110112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1120120010983 and 1120120011001.
It is not an unprimeable number, because it can be changed into a prime (1120120011013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93602576 + ... + 93614541.
It is an arithmetic number, because the mean of its divisors is an integer number (145280483568).
Almost surely, 21120120011011 is an apocalyptic number.
1120120011011 is a deficient number, since it is larger than the sum of its proper divisors (42123857533).
1120120011011 is a wasteful number, since it uses less digits than its factorization.
1120120011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187217341.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1120120011011 its reverse (1101100210211), we get a palindrome (2221220221222).
The spelling of 1120120011011 in words is "one trillion, one hundred twenty billion, one hundred twenty million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •