Base | Representation |
---|---|
bin | 100000010111101110110… |
… | …010011110101110110001 |
3 | 21212122211112022002011020 |
4 | 200113232302132232301 |
5 | 242421241100140023 |
6 | 4421531223210053 |
7 | 316500201406203 |
oct | 40275662365661 |
9 | 7778745262136 |
10 | 2224504302513 |
11 | 788452760169 |
12 | 2bb159ba6929 |
13 | 131a014b011c |
14 | 79949162773 |
15 | 3cce785ade3 |
hex | 205eec9ebb1 |
2224504302513 has 4 divisors (see below), whose sum is σ = 2966005736688. Its totient is φ = 1483002868340.
The previous prime is 2224504302511. The next prime is 2224504302521. The reversal of 2224504302513 is 3152034054222.
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 2224504302513 - 21 = 2224504302511 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2224504302511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 370750717083 + ... + 370750717088.
It is an arithmetic number, because the mean of its divisors is an integer number (741501434172).
Almost surely, 22224504302513 is an apocalyptic number.
It is an amenable number.
2224504302513 is a deficient number, since it is larger than the sum of its proper divisors (741501434175).
2224504302513 is an equidigital number, since it uses as much as digits as its factorization.
2224504302513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 741501434174.
The product of its (nonzero) digits is 57600, while the sum is 33.
Adding to 2224504302513 its reverse (3152034054222), we get a palindrome (5376538356735).
The spelling of 2224504302513 in words is "two trillion, two hundred twenty-four billion, five hundred four million, three hundred two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •