Base | Representation |
---|---|
bin | 1010000000010010100110… |
… | …1010010011110010011010 |
3 | 1102221121012121000112001100 |
4 | 2200010221222103302122 |
5 | 2420211211202431020 |
6 | 35221214133332230 |
7 | 2213505661656066 |
oct | 240045152236232 |
9 | 42847177015040 |
10 | 11000110202010 |
11 | 3561136489356 |
12 | 1297a8a797076 |
13 | 61a3c91ca347 |
14 | 2a05a0060aa6 |
15 | 1412111c6a90 |
hex | a0129a93c9a |
11000110202010 has 48 divisors (see below), whose sum is σ = 29373267251016. Its totient is φ = 2854082646144.
The previous prime is 11000110202009. The next prime is 11000110202033. The reversal of 11000110202010 is 1020201100011.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 10986221815209 + 13888386801 = 3314547^2 + 117849^2 .
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 = 11000110201983 and 11000110202001.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1651664869 + ... + 1651671528.
Almost surely, 211000110202010 is an apocalyptic number.
11000110202010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11000110202010 is an abundant number, since it is smaller than the sum of its proper divisors (18373157049006).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000110202010 is a wasteful number, since it uses less digits than its factorization.
11000110202010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3303336447 (or 3303336444 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11000110202010 its reverse (1020201100011), we get a palindrome (12020311302021).
The spelling of 11000110202010 in words is "eleven trillion, one hundred ten million, two hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •