Base | Representation |
---|---|
bin | 100000110101111… |
… | …0011000001010010 |
3 | 2211210121102002121 |
4 | 1001223303001102 |
5 | 4224103001320 |
6 | 301203404454 |
7 | 36210563413 |
oct | 10153630122 |
9 | 2753542077 |
10 | 1102000210 |
11 | 516061083 |
12 | 26908372a |
13 | 14740123c |
14 | a64dd80a |
15 | 66b2d8aa |
hex | 41af3052 |
1102000210 has 8 divisors (see below), whose sum is σ = 1983600396. Its totient is φ = 440800080.
The previous prime is 1102000181. The next prime is 1102000217. The reversal of 1102000210 is 120002011.
It can be written as a sum of positive squares in 2 ways, for example, as 1034973241 + 67026969 = 32171^2 + 8187^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1102000193 and 1102000202.
It is not an unprimeable number, because it can be changed into a prime (1102000217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55100001 + ... + 55100020.
Almost surely, 21102000210 is an apocalyptic number.
1102000210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1102000210 is a deficient number, since it is larger than the sum of its proper divisors (881600186).
1102000210 is a wasteful number, since it uses less digits than its factorization.
1102000210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110200028.
The product of its (nonzero) digits is 4, while the sum is 7.
The square root of 1102000210 is about 33196.3885083905. The cubic root of 1102000210 is about 1032.9054265961.
Adding to 1102000210 its reverse (120002011), we get a palindrome (1222002221).
The spelling of 1102000210 in words is "one billion, one hundred two million, two hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •