Base | Representation |
---|---|
bin | 1010001011111011111111… |
… | …1100010110100111100010 |
3 | 1110122201200012021221020101 |
4 | 2202332333330112213202 |
5 | 2432001002200311320 |
6 | 35453144552333014 |
7 | 2234121253166431 |
oct | 242767774264742 |
9 | 43581605257211 |
10 | 11200200010210 |
11 | 3628a83a0a802 |
12 | 130a8103a416a |
13 | 633236002063 |
14 | 2aa14203d118 |
15 | 14652248ac0a |
hex | a2fbff169e2 |
11200200010210 has 8 divisors (see below), whose sum is σ = 20160360018396. Its totient is φ = 4480080004080.
The previous prime is 11200200010201. The next prime is 11200200010243. The reversal of 11200200010210 is 1201000200211.
It can be written as a sum of positive squares in 2 ways, for example, as 10933583720409 + 266616289801 = 3306597^2 + 516349^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: 1120020001021 = 11200200010210 / (1 + 1 + 2 + 0 + 0 + 2 + 0 + 0 + 0 + 1 + 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, 560010000501 + ... + 560010000520.
Almost surely, 211200200010210 is an apocalyptic number.
11200200010210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11200200010210 is a deficient number, since it is larger than the sum of its proper divisors (8960160008186).
11200200010210 is a wasteful number, since it uses less digits than its factorization.
11200200010210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1120020001028.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11200200010210 its reverse (1201000200211), we get a palindrome (12401200210421).
The spelling of 11200200010210 in words is "eleven trillion, two hundred billion, two hundred million, ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •