Base | Representation |
---|---|
bin | 1100010110100101101… |
… | …0101110001101101111 |
3 | 202021210010011010121201 |
4 | 3011221122232031233 |
5 | 11434112313311343 |
6 | 241254330110331 |
7 | 21222026215606 |
oct | 3055132561557 |
9 | 667703133551 |
10 | 212222010223 |
11 | 820038793a3 |
12 | 3516887b3a7 |
13 | 170214763a2 |
14 | a3b33b0a3d |
15 | 57c144a94d |
hex | 31696ae36f |
212222010223 has 4 divisors (see below), whose sum is σ = 212295522640. Its totient is φ = 212148497808.
The previous prime is 212222010173. The next prime is 212222010227. The reversal of 212222010223 is 322010222212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212222010223 is a prime.
It is a super-2 number, since 2×2122220102232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 212222010223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212222010227) 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, 36751878 + ... + 36757651.
It is an arithmetic number, because the mean of its divisors is an integer number (53073880660).
Almost surely, 2212222010223 is an apocalyptic number.
212222010223 is a deficient number, since it is larger than the sum of its proper divisors (73512417).
212222010223 is an equidigital number, since it uses as much as digits as its factorization.
212222010223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73512416.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 212222010223 its reverse (322010222212), we get a palindrome (534232232435).
The spelling of 212222010223 in words is "two hundred twelve billion, two hundred twenty-two million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •