Base | Representation |
---|---|
bin | 1100010110100101101… |
… | …1000111010101101101 |
3 | 202021210010100100210012 |
4 | 3011221123013111231 |
5 | 11434112330110013 |
6 | 241254332223005 |
7 | 21222030124622 |
oct | 3055133072555 |
9 | 667703310705 |
10 | 212222113133 |
11 | 82003939748 |
12 | 3516890aa65 |
13 | 170214b1194 |
14 | a3b33da349 |
15 | 57c146b1a8 |
hex | 31696c756d |
212222113133 has 4 divisors (see below), whose sum is σ = 212654337888. Its totient is φ = 211789888380.
The previous prime is 212222113099. The next prime is 212222113151. The reversal of 212222113133 is 331311222212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 212222113133 - 220 = 212221064557 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212222113099 and 212222113108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212222113153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 216111641 + ... + 216112622.
It is an arithmetic number, because the mean of its divisors is an integer number (53163584472).
Almost surely, 2212222113133 is an apocalyptic number.
It is an amenable number.
212222113133 is a deficient number, since it is larger than the sum of its proper divisors (432224755).
212222113133 is an equidigital number, since it uses as much as digits as its factorization.
212222113133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432224754.
The product of its digits is 864, while the sum is 23.
Adding to 212222113133 its reverse (331311222212), we get a palindrome (543533335345).
The spelling of 212222113133 in words is "two hundred twelve billion, two hundred twenty-two million, one hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •