Base | Representation |
---|---|
bin | 1001010010010011111101… |
… | …0110011001110101101000 |
3 | 1100011002022101210201022200 |
4 | 2110210333112121311220 |
5 | 2314240442211201300 |
6 | 33414300130420200 |
7 | 2102443163615622 |
oct | 224447726316550 |
9 | 40132271721280 |
10 | 10210200100200 |
11 | 32871378604a1 |
12 | 118a97b431660 |
13 | 590a82755939 |
14 | 274267b7dc12 |
15 | 12a8cdaee200 |
hex | 9493f599d68 |
10210200100200 has 144 divisors (see below), whose sum is σ = 34290247992000. Its totient is φ = 2722641206400.
The previous prime is 10210200100193. The next prime is 10210200100213. The reversal of 10210200100200 is 200100201201.
It is a super-2 number, since 2×102102001002002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 88882401 + ... + 88997199.
Almost surely, 210210200100200 is an apocalyptic number.
10210200100200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10210200100200 is an abundant number, since it is smaller than the sum of its proper divisors (24080047891800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210200100200 is a wasteful number, since it uses less digits than its factorization.
10210200100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164232 (or 164220 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10210200100200 its reverse (200100201201), we get a palindrome (10410300301401).
The spelling of 10210200100200 in words is "ten trillion, two hundred ten billion, two hundred million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •