Base | Representation |
---|---|
bin | 11110101101001101000… |
… | …000110110101100101011 |
3 | 21110201120221221212121111 |
4 | 132231031000312230223 |
5 | 234033011434341021 |
6 | 4253213132251151 |
7 | 305310523443145 |
oct | 36551500665453 |
9 | 7421527855544 |
10 | 2110121012011 |
11 | 743996334021 |
12 | 2a0b57310ab7 |
13 | 123ca2b509cc |
14 | 741b7b73c95 |
15 | 39d50a2a8e1 |
hex | 1eb4d036b2b |
2110121012011 has 8 divisors (see below), whose sum is σ = 2124469535760. Its totient is φ = 2095783985568.
The previous prime is 2110121011891. The next prime is 2110121012017. The reversal of 2110121012011 is 1102101210112.
It is a happy number.
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 2110121012011 - 29 = 2110121011499 is a prime.
It is a super-2 number, since 2×21101210120112 (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 = 2110121011982 and 2110121012000.
It is not an unprimeable number, because it can be changed into a prime (2110121012017) 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, 2505856 + ... + 3240301.
It is an arithmetic number, because the mean of its divisors is an integer number (265558691970).
Almost surely, 22110121012011 is an apocalyptic number.
2110121012011 is a deficient number, since it is larger than the sum of its proper divisors (14348523749).
2110121012011 is a wasteful number, since it uses less digits than its factorization.
2110121012011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5748653.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2110121012011 its reverse (1102101210112), we get a palindrome (3212222222123).
The spelling of 2110121012011 in words is "two trillion, one hundred ten billion, one hundred twenty-one million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •