Base | Representation |
---|---|
bin | 1011000110101110100100… |
… | …1111000101011101101100 |
3 | 1121020021200112110122221110 |
4 | 2301223221033011131230 |
5 | 3100023002241213400 |
6 | 41545143150032020 |
7 | 2400105250256064 |
oct | 261535117053554 |
9 | 47207615418843 |
10 | 12210210101100 |
11 | 3988359312090 |
12 | 14525067a8610 |
13 | 6a75580ac0ab |
14 | 302d97ab43a4 |
15 | 162937904e50 |
hex | b1ae93c576c |
12210210101100 has 144 divisors (see below), whose sum is σ = 40568277214080. Its totient is φ = 2804258764800.
The previous prime is 12210210101083. The next prime is 12210210101101. The reversal of 12210210101100 is 110101201221.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (12210210101101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 97307397 + ... + 97432796.
It is an arithmetic number, because the mean of its divisors is an integer number (281724147320).
Almost surely, 212210210101100 is an apocalyptic number.
12210210101100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12210210101100 is an abundant number, since it is smaller than the sum of its proper divisors (28358067112980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12210210101100 is a wasteful number, since it uses less digits than its factorization.
12210210101100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194740240 (or 194740233 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12210210101100 its reverse (110101201221), we get a palindrome (12320311302321).
The spelling of 12210210101100 in words is "twelve trillion, two hundred ten billion, two hundred ten million, one hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •