Base | Representation |
---|---|
bin | 10000000000011101000… |
… | …111110000011000010010 |
3 | 10220011021220102221100221 |
4 | 100000131013300120102 |
5 | 121010300022401320 |
6 | 2201155541503254 |
7 | 142321013300152 |
oct | 20003507603022 |
9 | 3804256387327 |
10 | 1100000200210 |
11 | 39456448845a |
12 | 15922ba11b2a |
13 | 7c963b48442 |
14 | 3b35151a762 |
15 | 1d9309e03aa |
hex | 1001d1f0612 |
1100000200210 has 64 divisors (see below), whose sum is σ = 2132501904000. Its totient is φ = 407003784192.
The previous prime is 1100000200207. The next prime is 1100000200253. The reversal of 1100000200210 is 120020000011.
It is a junction number, because it is equal to n+sod(n) for n = 1100000200193 and 1100000200202.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54583216 + ... + 54603364.
It is an arithmetic number, because the mean of its divisors is an integer number (33320342250).
Almost surely, 21100000200210 is an apocalyptic number.
1100000200210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1100000200210 is a deficient number, since it is larger than the sum of its proper divisors (1032501703790).
1100000200210 is a wasteful number, since it uses less digits than its factorization.
1100000200210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25675.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 1100000200210 its reverse (120020000011), we get a palindrome (1220020200221).
The spelling of 1100000200210 in words is "one trillion, one hundred billion, two hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •