Base | Representation |
---|---|
bin | 111110111000100… |
… | …0011011010000100 |
3 | 12110001100122222000 |
4 | 1331301003122010 |
5 | 13310130323022 |
6 | 545212505300 |
7 | 103200540414 |
oct | 17561033204 |
9 | 5401318860 |
10 | 2110011012 |
11 | 99305655a |
12 | 4aa77b230 |
13 | 2781b4735 |
14 | 160334644 |
15 | c53936ac |
hex | 7dc43684 |
2110011012 has 48 divisors (see below), whose sum is σ = 5485737600. Its totient is φ = 701364960.
The previous prime is 2110010993. The next prime is 2110011017. The reversal of 2110011012 is 2101100112.
It is a happy number.
It is a super-2 number, since 2×21100110122 = 8904292941522528288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2110010985 and 2110011003.
It is not an unprimeable number, because it can be changed into a prime (2110011017) 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, 11562 + ... + 65982.
It is an arithmetic number, because the mean of its divisors is an integer number (114286200).
Almost surely, 22110011012 is an apocalyptic number.
It is an amenable number.
2110011012 is an abundant number, since it is smaller than the sum of its proper divisors (3375726588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2110011012 is a wasteful number, since it uses less digits than its factorization.
2110011012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54793 (or 54785 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 2110011012 is about 45934.8561769818. The cubic root of 2110011012 is about 1282.6108436737.
Adding to 2110011012 its reverse (2101100112), we get a palindrome (4211111124).
The spelling of 2110011012 in words is "two billion, one hundred ten million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •