Base | Representation |
---|---|
bin | 1010000000111000001110… |
… | …1010010111001111110010 |
3 | 1102222120021110202111202001 |
4 | 2200032003222113033302 |
5 | 2420342402241201320 |
6 | 35230004245244214 |
7 | 2214314161460326 |
oct | 240160352271762 |
9 | 42876243674661 |
10 | 11010210100210 |
11 | 3565449625362 |
12 | 1299a2910366a |
13 | 61b3487c3b79 |
14 | 2a0c7b589986 |
15 | 141602c1920a |
hex | a0383a973f2 |
11010210100210 has 8 divisors (see below), whose sum is σ = 19818378180396. Its totient is φ = 4404084040080.
The previous prime is 11010210100199. The next prime is 11010210100247. The reversal of 11010210100210 is 1200101201011.
It can be written as a sum of positive squares in 2 ways, for example, as 10973047128481 + 37162971729 = 3312559^2 + 192777^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 1101021010021 = 11010210100210 / (1 + 1 + 0 + 1 + 0 + 2 + 1 + 0 + 1 + 0 + 0 + 2 + 1 + 0).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550510505001 + ... + 550510505020.
Almost surely, 211010210100210 is an apocalyptic number.
11010210100210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11010210100210 is a deficient number, since it is larger than the sum of its proper divisors (8808168080186).
11010210100210 is a wasteful number, since it uses less digits than its factorization.
11010210100210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101021010028.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11010210100210 its reverse (1200101201011), we get a palindrome (12210311301221).
The spelling of 11010210100210 in words is "eleven trillion, ten billion, two hundred ten million, one hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •