Base | Representation |
---|---|
bin | 1000010001010100… |
… | …1010011110000011 |
3 | 12201201120211002221 |
4 | 2010111022132003 |
5 | 14021323443134 |
6 | 1004145151511 |
7 | 106005611410 |
oct | 20425123603 |
9 | 5651524087 |
10 | 2220140419 |
11 | a3a2363a2 |
12 | 51b62b597 |
13 | 294c63973 |
14 | 170c01107 |
15 | ced995b4 |
hex | 8454a783 |
2220140419 has 8 divisors (see below), whose sum is σ = 2539008000. Its totient is φ = 1901699016.
The previous prime is 2220140411. The next prime is 2220140477. The reversal of 2220140419 is 9140410222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2220140419 - 23 = 2220140411 is a prime.
It is a super-2 number, since 2×22201404192 = 9858046960154991122, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2220140393 and 2220140402.
It is not an unprimeable number, because it can be changed into a prime (2220140411) 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 7 ways as a sum of consecutive naturals, for example, 95299 + ... + 116284.
It is an arithmetic number, because the mean of its divisors is an integer number (317376000).
Almost surely, 22220140419 is an apocalyptic number.
2220140419 is a deficient number, since it is larger than the sum of its proper divisors (318867581).
2220140419 is a wasteful number, since it uses less digits than its factorization.
2220140419 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213089.
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 2220140419 is about 47118.3660476464. The cubic root of 2220140419 is about 1304.5482538699.
The spelling of 2220140419 in words is "two billion, two hundred twenty million, one hundred forty thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •