Base | Representation |
---|---|
bin | 10000001011101000011… |
… | …111011010001000111011 |
3 | 10221022021100011010110202 |
4 | 100023220133122020323 |
5 | 121204340020010021 |
6 | 2210502520232415 |
7 | 143224306656632 |
oct | 20135037321073 |
9 | 3838240133422 |
10 | 1112002110011 |
11 | 399663223981 |
12 | 15b61b30b70b |
13 | 80b274cb310 |
14 | 3bb6d4b4519 |
15 | 1ddd44dba0b |
hex | 102e87da23b |
1112002110011 has 8 divisors (see below), whose sum is σ = 1220135842800. Its totient is φ = 1007096249952.
The previous prime is 1112002110001. The next prime is 1112002110013. The reversal of 1112002110011 is 1100112002111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1112002110011 - 226 = 1111935001147 is a prime.
It is a super-2 number, since 2×11120021100112 (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 = 1112002109974 and 1112002110001.
It is not an unprimeable number, because it can be changed into a prime (1112002110013) 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, 806967461 + ... + 806968838.
It is an arithmetic number, because the mean of its divisors is an integer number (152516980350).
Almost surely, 21112002110011 is an apocalyptic number.
1112002110011 is a deficient number, since it is larger than the sum of its proper divisors (108133732789).
1112002110011 is a wasteful number, since it uses less digits than its factorization.
1112002110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1613936365.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1112002110011 its reverse (1100112002111), we get a palindrome (2212114112122).
The spelling of 1112002110011 in words is "one trillion, one hundred twelve billion, two million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •