Base | Representation |
---|---|
bin | 1000010001010011… |
… | …1111101010001111 |
3 | 12201201111120101002 |
4 | 2010110333222033 |
5 | 14021321034033 |
6 | 1004144210515 |
7 | 106005335336 |
oct | 20424775217 |
9 | 5651446332 |
10 | 2220096143 |
11 | a3a206101 |
12 | 51b609a3b |
13 | 294c49775 |
14 | 170bccd1d |
15 | ced8b3e8 |
hex | 8453fa8f |
2220096143 has 4 divisors (see below), whose sum is σ = 2226457800. Its totient is φ = 2213734488.
The previous prime is 2220096139. The next prime is 2220096161. The reversal of 2220096143 is 3416900222.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3416900222 = 2 ⋅1708450111.
It is a cyclic number.
It is not a de Polignac number, because 2220096143 - 22 = 2220096139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2220096343) 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, 3180305 + ... + 3181002.
It is an arithmetic number, because the mean of its divisors is an integer number (556614450).
Almost surely, 22220096143 is an apocalyptic number.
2220096143 is a deficient number, since it is larger than the sum of its proper divisors (6361657).
2220096143 is an equidigital number, since it uses as much as digits as its factorization.
2220096143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6361656.
The product of its (nonzero) digits is 5184, while the sum is 29.
The square root of 2220096143 is about 47117.8962072799. The cubic root of 2220096143 is about 1304.5395816613.
Adding to 2220096143 its reverse (3416900222), we get a palindrome (5636996365).
The spelling of 2220096143 in words is "two billion, two hundred twenty million, ninety-six thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •