Base | Representation |
---|---|
bin | 1001001000111111001100… |
… | …00001000010100010011000 |
3 | 2122011112122022211020001122 |
4 | 10210133212001002202120 |
5 | 10113304310304311300 |
6 | 110425452333104412 |
7 | 4143115003415042 |
oct | 444374601024230 |
9 | 78145568736048 |
10 | 20100011010200 |
11 | 644a404233280 |
12 | 2307625028108 |
13 | b2a566179a94 |
14 | 4d6bba946a92 |
15 | 24ccaa047c85 |
hex | 1247e6042898 |
20100011010200 has 48 divisors (see below), whose sum is σ = 50980937022360. Its totient is φ = 7309094912000.
The previous prime is 20100011010199. The next prime is 20100011010217. The reversal of 20100011010200 is 201011000102.
It is a super-2 number, since 2×201000110102002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4568182121 + ... + 4568186520.
Almost surely, 220100011010200 is an apocalyptic number.
20100011010200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20100011010200 is an abundant number, since it is smaller than the sum of its proper divisors (30880926012160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20100011010200 is a wasteful number, since it uses less digits than its factorization.
20100011010200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9136368668 (or 9136368659 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 20100011010200 its reverse (201011000102), we get a palindrome (20301022010302).
The spelling of 20100011010200 in words is "twenty trillion, one hundred billion, eleven million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •