Base | Representation |
---|---|
bin | 1001101001010111000011… |
… | …00001101001110001011100 |
3 | 2210002212201220101102222011 |
4 | 10310223201201221301130 |
5 | 10240020324020444400 |
6 | 113040451052401004 |
7 | 4316353236513553 |
oct | 464534141516134 |
9 | 83085656342864 |
10 | 21212332203100 |
11 | 6839110584915 |
12 | 2467113176164 |
13 | bab4117c7a2c |
14 | 53497a55ad9a |
15 | 26bbac5628ba |
hex | 134ae1869c5c |
21212332203100 has 18 divisors (see below), whose sum is σ = 46030760880944. Its totient is φ = 8484932881200.
The previous prime is 21212332203091. The next prime is 21212332203107. The reversal of 21212332203100 is 130223321212.
It is a super-2 number, since 2×212123322031002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21212332203107) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 106061660916 + ... + 106061661115.
Almost surely, 221212332203100 is an apocalyptic number.
21212332203100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21212332203100 is an abundant number, since it is smaller than the sum of its proper divisors (24818428677844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21212332203100 is a wasteful number, since it uses less digits than its factorization.
21212332203100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212123322045 (or 212123322038 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 21212332203100 its reverse (130223321212), we get a palindrome (21342555524312).
The spelling of 21212332203100 in words is "twenty-one trillion, two hundred twelve billion, three hundred thirty-two million, two hundred three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •