Base | Representation |
---|---|
bin | 100000110110010… |
… | …1000101011101010 |
3 | 2211211000120121100 |
4 | 1001230220223222 |
5 | 4224132020020 |
6 | 301212222230 |
7 | 36212500263 |
oct | 10154505352 |
9 | 2754016540 |
10 | 1102220010 |
11 | 5161a1231 |
12 | 26916a976 |
13 | 14747a2b8 |
14 | a655996a |
15 | 66b73a90 |
hex | 41b28aea |
1102220010 has 48 divisors (see below), whose sum is σ = 2943234216. Its totient is φ = 285980544.
The previous prime is 1102220003. The next prime is 1102220027. The reversal of 1102220010 is 100222011.
It can be written as a sum of positive squares in 4 ways, for example, as 1093558761 + 8661249 = 33069^2 + 2943^2 .
It is a super-3 number, since 3×11022200103 (a number of 28 digits) contains 333 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 = 1102219974 and 1102220001.
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, 162169 + ... + 168828.
Almost surely, 21102220010 is an apocalyptic number.
1102220010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1102220010 is an abundant number, since it is smaller than the sum of its proper divisors (1841014206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102220010 is a wasteful number, since it uses less digits than its factorization.
1102220010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 331047 (or 331044 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 1102220010 is about 33199.6989444182. The cubic root of 1102220010 is about 1032.9740949194.
Adding to 1102220010 its reverse (100222011), we get a palindrome (1202442021).
The spelling of 1102220010 in words is "one billion, one hundred two million, two hundred twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •