Base | Representation |
---|---|
bin | 110000010000001111010000… |
… | …001100111000100101101100 |
3 | 1000211102020101120122000120001 |
4 | 300100033100030320211230 |
5 | 210304021401224213400 |
6 | 2031205255203034044 |
7 | 62462354011124566 |
oct | 6020172014704554 |
9 | 1024366346560501 |
10 | 212222122101100 |
11 | 61690995341331 |
12 | 1b97609b36b924 |
13 | 91555ca200c87 |
14 | 3a5986976a336 |
15 | 19805b7630a6a |
hex | c103d033896c |
212222122101100 has 36 divisors (see below), whose sum is σ = 460525899456000. Its totient is φ = 84888130960960.
The previous prime is 212222122101061. The next prime is 212222122101137. The reversal of 212222122101100 is 1101221222212.
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, 2989926 + ... + 20817874.
It is an arithmetic number, because the mean of its divisors is an integer number (12792386096000).
Almost surely, 2212222122101100 is an apocalyptic number.
212222122101100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212222122101100 is an abundant number, since it is smaller than the sum of its proper divisors (248303777354900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212222122101100 is a wasteful number, since it uses less digits than its factorization.
212222122101100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17947002 (or 17946995 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 212222122101100 its reverse (1101221222212), we get a palindrome (213323343323312).
The spelling of 212222122101100 in words is "two hundred twelve trillion, two hundred twenty-two billion, one hundred twenty-two million, one hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •