Base | Representation |
---|---|
bin | 11001010011101… |
… | …11010110100111 |
3 | 112210111000112021 |
4 | 30221313112213 |
5 | 413322114343 |
6 | 33022204011 |
7 | 5155350001 |
oct | 1451672647 |
9 | 483430467 |
10 | 212301223 |
11 | a9925062 |
12 | 5b123607 |
13 | 34ca3434 |
14 | 202a5371 |
15 | 139890ed |
hex | ca775a7 |
212301223 has 8 divisors (see below), whose sum is σ = 215470800. Its totient is φ = 209149248.
The previous prime is 212301197. The next prime is 212301263. The reversal of 212301223 is 322103212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212301223 - 217 = 212170151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212301197 and 212301206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212301263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20973 + ... + 29401.
It is an arithmetic number, because the mean of its divisors is an integer number (26933850).
Almost surely, 2212301223 is an apocalyptic number.
212301223 is a deficient number, since it is larger than the sum of its proper divisors (3169577).
212301223 is an equidigital number, since it uses as much as digits as its factorization.
212301223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8801.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 212301223 is about 14570.5601470911. The cubic root of 212301223 is about 596.5554696742. Note that the first 3 decimals are identical.
Adding to 212301223 its reverse (322103212), we get a palindrome (534404435).
The spelling of 212301223 in words is "two hundred twelve million, three hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •