Base | Representation |
---|---|
bin | 111111010100011… |
… | …0011001001101001 |
3 | 12111001212002212220 |
4 | 1332220303021221 |
5 | 13322400440424 |
6 | 550454024253 |
7 | 103436003331 |
oct | 17650631151 |
9 | 5431762786 |
10 | 2124624489 |
11 | 9a0327909 |
12 | 4b3648089 |
13 | 27b230170 |
14 | 16225a0c1 |
15 | c67cd579 |
hex | 7ea33269 |
2124624489 has 8 divisors (see below), whose sum is σ = 3050742912. Its totient is φ = 1307461200.
The previous prime is 2124624473. The next prime is 2124624497. The reversal of 2124624489 is 9844264212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2124624489 - 24 = 2124624473 is a prime.
It is a super-2 number, since 2×21246244892 = 9028058438517022242, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2124624489.
It is not an unprimeable number, because it can be changed into a prime (2124624889) 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, 27238737 + ... + 27238814.
It is an arithmetic number, because the mean of its divisors is an integer number (381342864).
Almost surely, 22124624489 is an apocalyptic number.
It is an amenable number.
2124624489 is a deficient number, since it is larger than the sum of its proper divisors (926118423).
2124624489 is a wasteful number, since it uses less digits than its factorization.
2124624489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54477567.
The product of its digits is 221184, while the sum is 42.
The square root of 2124624489 is about 46093.6491178557. The cubic root of 2124624489 is about 1285.5650618859.
The spelling of 2124624489 in words is "two billion, one hundred twenty-four million, six hundred twenty-four thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •