Base | Representation |
---|---|
bin | 1100111110110100001… |
… | …0100101011110111101 |
3 | 210022122122212112010211 |
4 | 3033231002211132331 |
5 | 12123221133210414 |
6 | 250242025032421 |
7 | 22053435336124 |
oct | 3175502453675 |
9 | 708578775124 |
10 | 223020210109 |
11 | 86645104834 |
12 | 37281025711 |
13 | 18052636288 |
14 | ab19550abb |
15 | 5c044273c4 |
hex | 33ed0a57bd |
223020210109 has 4 divisors (see below), whose sum is σ = 223047714240. Its totient is φ = 222992705980.
The previous prime is 223020210053. The next prime is 223020210173. The reversal of 223020210109 is 901012020322.
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 223020210109 - 231 = 220872726461 is a prime.
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 223020210109.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223020210209) by changing a digit.
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, 13739899 + ... + 13756120.
It is an arithmetic number, because the mean of its divisors is an integer number (55761928560).
Almost surely, 2223020210109 is an apocalyptic number.
It is an amenable number.
223020210109 is a deficient number, since it is larger than the sum of its proper divisors (27504131).
223020210109 is an equidigital number, since it uses as much as digits as its factorization.
223020210109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27504130.
The product of its (nonzero) digits is 432, while the sum is 22.
The spelling of 223020210109 in words is "two hundred twenty-three billion, twenty million, two hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •