Base | Representation |
---|---|
bin | 1000101101111100… |
… | …1111110001110001 |
3 | 20001002112200222011 |
4 | 2023133033301301 |
5 | 14243044132423 |
6 | 1024115042521 |
7 | 111664401553 |
oct | 21337176161 |
9 | 6032480864 |
10 | 2340224113 |
11 | aa0aa5017 |
12 | 5538a0441 |
13 | 2b3ab99c6 |
14 | 182b3d4d3 |
15 | da6b9b0d |
hex | 8b7cfc71 |
2340224113 has 4 divisors (see below), whose sum is σ = 2373185088. Its totient is φ = 2307263140.
The previous prime is 2340224101. The next prime is 2340224119. The reversal of 2340224113 is 3114220432.
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 2340224113 - 29 = 2340223601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2340224119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16480381 + ... + 16480522.
It is an arithmetic number, because the mean of its divisors is an integer number (593296272).
Almost surely, 22340224113 is an apocalyptic number.
It is an amenable number.
2340224113 is a deficient number, since it is larger than the sum of its proper divisors (32960975).
2340224113 is an equidigital number, since it uses as much as digits as its factorization.
2340224113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32960974.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 2340224113 is about 48375.8629173682. The cubic root of 2340224113 is about 1327.6567769037.
Adding to 2340224113 its reverse (3114220432), we get a palindrome (5454444545).
The spelling of 2340224113 in words is "two billion, three hundred forty million, two hundred twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •