Base | Representation |
---|---|
bin | 1001010101001011… |
… | …0010011101111001 |
3 | 20110120002111021220 |
4 | 2111102302131321 |
5 | 20112202333424 |
6 | 1052313022253 |
7 | 116032600152 |
oct | 22522623571 |
9 | 6416074256 |
10 | 2504730489 |
11 | 10759450a8 |
12 | 59a9b4989 |
13 | 30bbc7661 |
14 | 19a922929 |
15 | e9d62579 |
hex | 954b2779 |
2504730489 has 4 divisors (see below), whose sum is σ = 3339640656. Its totient is φ = 1669820324.
The previous prime is 2504730443. The next prime is 2504730523. The reversal of 2504730489 is 9840374052.
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 2504730489 - 220 = 2503681913 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2504730489.
It is not an unprimeable number, because it can be changed into a prime (2504730419) 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, 417455079 + ... + 417455084.
It is an arithmetic number, because the mean of its divisors is an integer number (834910164).
Almost surely, 22504730489 is an apocalyptic number.
It is an amenable number.
2504730489 is a deficient number, since it is larger than the sum of its proper divisors (834910167).
2504730489 is an equidigital number, since it uses as much as digits as its factorization.
2504730489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 834910166.
The product of its (nonzero) digits is 241920, while the sum is 42.
The square root of 2504730489 is about 50047.2825336201. The cubic root of 2504730489 is about 1358.0643037810.
The spelling of 2504730489 in words is "two billion, five hundred four million, seven hundred thirty thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •