Base | Representation |
---|---|
bin | 1001000011011001… |
… | …0101111110110001 |
3 | 20021100210011112220 |
4 | 2100312111332301 |
5 | 14434110234123 |
6 | 1041050511253 |
7 | 114136026621 |
oct | 22066257661 |
9 | 6240704486 |
10 | 2430164913 |
11 | 1037845960 |
12 | 579a35529 |
13 | 2c961aa07 |
14 | 190a72881 |
15 | e3533ce3 |
hex | 90d95fb1 |
2430164913 has 8 divisors (see below), whose sum is σ = 3534785376. Its totient is φ = 1472827200.
The previous prime is 2430164903. The next prime is 2430164929. The reversal of 2430164913 is 3194610342.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2430164913 - 24 = 2430164897 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 73641361 = 2430164913 / (2 + 4 + 3 + 0 + 1 + 6 + 4 + 9 + 1 + 3).
It is not an unprimeable number, because it can be changed into a prime (2430164903) 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 7 ways as a sum of consecutive naturals, for example, 36820648 + ... + 36820713.
It is an arithmetic number, because the mean of its divisors is an integer number (441848172).
Almost surely, 22430164913 is an apocalyptic number.
It is an amenable number.
2430164913 is a deficient number, since it is larger than the sum of its proper divisors (1104620463).
2430164913 is a wasteful number, since it uses less digits than its factorization.
2430164913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73641375.
The product of its (nonzero) digits is 15552, while the sum is 33.
The square root of 2430164913 is about 49296.7028613476. The cubic root of 2430164913 is about 1344.4518365261.
The spelling of 2430164913 in words is "two billion, four hundred thirty million, one hundred sixty-four thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •