Base | Representation |
---|---|
bin | 110000001111111010101010… |
… | …001110010101100010010010 |
3 | 1000211100010022120000112201021 |
4 | 300033322222032111202102 |
5 | 210303141110042023442 |
6 | 2031151201110230054 |
7 | 62460642032245525 |
oct | 6017725216254222 |
9 | 1024303276015637 |
10 | 212200010111122 |
11 | 61682578734a50 |
12 | 1b97194a05532a |
13 | 91534b50cac37 |
14 | 3a5876cb96bbc |
15 | 197ec2127ee67 |
hex | c0feaa395892 |
212200010111122 has 8 divisors (see below), whose sum is σ = 347236380181872. Its totient is φ = 96454550050500.
The previous prime is 212200010111083. The next prime is 212200010111137. The reversal of 212200010111122 is 221111010002212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 212200010111096 and 212200010111105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4822727502504 + ... + 4822727502547.
It is an arithmetic number, because the mean of its divisors is an integer number (43404547522734).
Almost surely, 2212200010111122 is an apocalyptic number.
212200010111122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
212200010111122 is a deficient number, since it is larger than the sum of its proper divisors (135036370070750).
212200010111122 is a wasteful number, since it uses less digits than its factorization.
212200010111122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9645455005064.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 212200010111122 its reverse (221111010002212), we get a palindrome (433311020113334).
The spelling of 212200010111122 in words is "two hundred twelve trillion, two hundred billion, ten million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •