Base | Representation |
---|---|
bin | 1001010010010111000001… |
… | …0010010001010001000100 |
3 | 1100011011102121122211110101 |
4 | 2110211300102101101010 |
5 | 2314244132400200400 |
6 | 33414513415333444 |
7 | 2102502423164422 |
oct | 224456022212104 |
9 | 40134377584411 |
10 | 10211021100100 |
11 | 3287519234907 |
12 | 118ab6a381284 |
13 | 590b8387c0b2 |
14 | 274304c14112 |
15 | 12a92ac2356a |
hex | 94970491444 |
10211021100100 has 36 divisors (see below), whose sum is σ = 22158219283200. Its totient is φ = 4084352496160.
The previous prime is 10211021100079. The next prime is 10211021100107. The reversal of 10211021100100 is 100112011201.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (10211021100107) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7067241 + ... + 8388559.
It is an arithmetic number, because the mean of its divisors is an integer number (615506091200).
Almost surely, 210211021100100 is an apocalyptic number.
10211021100100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10211021100100 is an abundant number, since it is smaller than the sum of its proper divisors (11947198183100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10211021100100 is a wasteful number, since it uses less digits than its factorization.
10211021100100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1398612 (or 1398605 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10211021100100 its reverse (100112011201), we get a palindrome (10311133111301).
The spelling of 10211021100100 in words is "ten trillion, two hundred eleven billion, twenty-one million, one hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •