Base | Representation |
---|---|
bin | 100000110110010… |
… | …0110001111011011 |
3 | 2211211000001220000 |
4 | 1001230212033123 |
5 | 4224131210021 |
6 | 301212104043 |
7 | 36212426160 |
oct | 10154461733 |
9 | 2754001800 |
10 | 1102210011 |
11 | 516194771 |
12 | 269165023 |
13 | 147475896 |
14 | a6556067 |
15 | 66b70b26 |
hex | 41b263db |
1102210011 has 80 divisors (see below), whose sum is σ = 2041744320. Its totient is φ = 578119680.
The previous prime is 1102210009. The next prime is 1102210049. The reversal of 1102210011 is 1100122011.
It is a happy number.
1102210011 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1102210011 - 21 = 1102210009 is a prime.
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 = 1102209975 and 1102210002.
It is not an unprimeable number, because it can be changed into a prime (1102210001) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 393805 + ... + 396593.
It is an arithmetic number, because the mean of its divisors is an integer number (25521804).
Almost surely, 21102210011 is an apocalyptic number.
1102210011 is a deficient number, since it is larger than the sum of its proper divisors (939534309).
1102210011 is a wasteful number, since it uses less digits than its factorization.
1102210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2866 (or 2857 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 1102210011 is about 33199.5483553617. The cubic root of 1102210011 is about 1032.9709713025.
Adding to 1102210011 its reverse (1100122011), we get a palindrome (2202332022).
The spelling of 1102210011 in words is "one billion, one hundred two million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •