Base | Representation |
---|---|
bin | 11010001101110… |
… | …11101101000111 |
3 | 120022211011012111 |
4 | 31012323231013 |
5 | 422244434343 |
6 | 33453401451 |
7 | 5310204514 |
oct | 1506735507 |
9 | 508734174 |
10 | 219921223 |
11 | 10315a085 |
12 | 61799287 |
13 | 36740902 |
14 | 212ca30b |
15 | 14491c9d |
hex | d1bbb47 |
219921223 has 4 divisors (see below), whose sum is σ = 227015488. Its totient is φ = 212826960.
The previous prime is 219921217. The next prime is 219921263. The reversal of 219921223 is 322129912.
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-219921223 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31), and also a Moran number because the ratio is a prime number: 7094233 = 219921223 / (2 + 1 + 9 + 9 + 2 + 1 + 2 + 2 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (219921203) 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 3 ways as a sum of consecutive naturals, for example, 3547086 + ... + 3547147.
It is an arithmetic number, because the mean of its divisors is an integer number (56753872).
Almost surely, 2219921223 is an apocalyptic number.
219921223 is a deficient number, since it is larger than the sum of its proper divisors (7094265).
219921223 is an equidigital number, since it uses as much as digits as its factorization.
219921223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7094264.
The product of its digits is 3888, while the sum is 31.
The square root of 219921223 is about 14829.7411642955. The cubic root of 219921223 is about 603.6090102535.
The spelling of 219921223 in words is "two hundred nineteen million, nine hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •