Base | Representation |
---|---|
bin | 110000001110110000011011… |
… | …010000001001100101000110 |
3 | 1000211001111120120012122112221 |
4 | 300032300123100021211012 |
5 | 210300334334310030342 |
6 | 2031050415501402554 |
7 | 62452120553621002 |
oct | 6016603320114506 |
9 | 1024044516178487 |
10 | 212120302033222 |
11 | 61651795595300 |
12 | 1b95a403b6945a |
13 | 9148b215c61bb |
14 | 3a5496aacb702 |
15 | 197cb08726a67 |
hex | c0ec1b409946 |
212120302033222 has 24 divisors (see below), whose sum is σ = 349767014585688. Its totient is φ = 96409641709920.
The previous prime is 212120302033193. The next prime is 212120302033223. The reversal of 212120302033222 is 222330203021212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212120302033223) by changing a digit.
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, 36747808 + ... + 42126499.
It is an arithmetic number, because the mean of its divisors is an integer number (14573625607737).
Almost surely, 2212120302033222 is an apocalyptic number.
212120302033222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
212120302033222 is a deficient number, since it is larger than the sum of its proper divisors (137646712552466).
212120302033222 is a wasteful number, since it uses less digits than its factorization.
212120302033222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78885444 (or 78885433 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 212120302033222 its reverse (222330203021212), we get a palindrome (434450505054434).
The spelling of 212120302033222 in words is "two hundred twelve trillion, one hundred twenty billion, three hundred two million, thirty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •