Base | Representation |
---|---|
bin | 111011111011101… |
… | …1110001001011110 |
3 | 12012011002220200200 |
4 | 1313313132021132 |
5 | 13104310430420 |
6 | 531315204330 |
7 | 100556321355 |
oct | 16767361136 |
9 | 5164086620 |
10 | 2011030110 |
11 | 9421a0761 |
12 | 4815a66a6 |
13 | 260839a5b |
14 | 15112a99c |
15 | bb840b90 |
hex | 77dde25e |
2011030110 has 48 divisors (see below), whose sum is σ = 5503876560. Its totient is φ = 508049280.
The previous prime is 2011030097. The next prime is 2011030117. The reversal of 2011030110 is 110301102.
It is a super-2 number, since 2×20110301102 = 8088484206653224200, 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 = 2011030092 and 2011030101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011030117) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 586311 + ... + 589730.
It is an arithmetic number, because the mean of its divisors is an integer number (114664095).
Almost surely, 22011030110 is an apocalyptic number.
2011030110 is an abundant number, since it is smaller than the sum of its proper divisors (3492846450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011030110 is a wasteful number, since it uses less digits than its factorization.
2011030110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1176073 (or 1176070 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 2011030110 is about 44844.5103663759. The cubic root of 2011030110 is about 1262.2329829054.
Adding to 2011030110 its reverse (110301102), we get a palindrome (2121331212).
The spelling of 2011030110 in words is "two billion, eleven million, thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •