Base | Representation |
---|---|
bin | 11101101101111100110… |
… | …00000010010011101100 |
3 | 10121121122022002112002110 |
4 | 32312332120002103230 |
5 | 113212203403033400 |
6 | 2101030514524020 |
7 | 133525561113042 |
oct | 16667630022354 |
9 | 3547568075073 |
10 | 1021101221100 |
11 | 3640570236a4 |
12 | 145a90896610 |
13 | 7539bb60b9c |
14 | 375c8aa8392 |
15 | 1b864009e50 |
hex | edbe6024ec |
1021101221100 has 72 divisors (see below), whose sum is σ = 3034234508368. Its totient is φ = 264934368000.
The previous prime is 1021101221083. The next prime is 1021101221117. The reversal of 1021101221100 is 11221011201.
It is an interprime number because it is at equal distance from previous prime (1021101221083) and next prime (1021101221117).
It is a super-2 number, since 2×10211012211002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 45984451 + ... + 46006650.
Almost surely, 21021101221100 is an apocalyptic number.
1021101221100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1021101221100 is an abundant number, since it is smaller than the sum of its proper divisors (2013133287268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021101221100 is a wasteful number, since it uses less digits than its factorization.
1021101221100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91991155 (or 91991148 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1021101221100 its reverse (11221011201), we get a palindrome (1032322232301).
The spelling of 1021101221100 in words is "one trillion, twenty-one billion, one hundred one million, two hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •