Base | Representation |
---|---|
bin | 11101101110001001101… |
… | …11110000100000100100 |
3 | 10121121220220011020011201 |
4 | 32313010313300200210 |
5 | 113212414302400400 |
6 | 2101045410412244 |
7 | 133531353323056 |
oct | 16670467604044 |
9 | 3547826136151 |
10 | 1021210200100 |
11 | 364102598192 |
12 | 145b01291084 |
13 | 753b85c95bc |
14 | 375d93558d6 |
15 | 1b86d88506a |
hex | edc4df0824 |
1021210200100 has 36 divisors (see below), whose sum is σ = 2217734994244. Its totient is φ = 408169082880.
The previous prime is 1021210200083. The next prime is 1021210200113. The reversal of 1021210200100 is 10020121201.
It can be written as a sum of positive squares in 6 ways, for example, as 140075038756 + 881135161344 = 374266^2 + 938688^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3807117 + ... + 4066516.
Almost surely, 21021210200100 is an apocalyptic number.
1021210200100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1021210200100 is an abundant number, since it is smaller than the sum of its proper divisors (1196524794144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021210200100 is a wasteful number, since it uses less digits than its factorization.
1021210200100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7874944 (or 7874937 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1021210200100 its reverse (10020121201), we get a palindrome (1031230321301).
The spelling of 1021210200100 in words is "one trillion, twenty-one billion, two hundred ten million, two hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •