Base | Representation |
---|---|
bin | 100100011100101… |
… | …1000000010011011 |
3 | 10011020021211220102 |
4 | 1020321120002123 |
5 | 10001042001334 |
6 | 321205050015 |
7 | 42210221210 |
oct | 11071300233 |
9 | 3136254812 |
10 | 1223000219 |
11 | 578396191 |
12 | 2a16b690b |
13 | 1664b838c |
14 | b85d9b07 |
15 | 7258067e |
hex | 48e5809b |
1223000219 has 4 divisors (see below), whose sum is σ = 1397714544. Its totient is φ = 1048285896.
The previous prime is 1223000201. The next prime is 1223000279. The reversal of 1223000219 is 9120003221.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1223000219 - 216 = 1222934683 is a prime.
It is a super-2 number, since 2×12230002192 = 2991459071348095922, which 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 1223000219.
It is not an unprimeable number, because it can be changed into a prime (1223000279) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87357152 + ... + 87357165.
It is an arithmetic number, because the mean of its divisors is an integer number (349428636).
Almost surely, 21223000219 is an apocalyptic number.
1223000219 is a deficient number, since it is larger than the sum of its proper divisors (174714325).
1223000219 is an equidigital number, since it uses as much as digits as its factorization.
1223000219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174714324.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 1223000219 is about 34971.4200312198. The cubic root of 1223000219 is about 1069.4049210962.
The spelling of 1223000219 in words is "one billion, two hundred twenty-three million, two hundred nineteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •