Base | Representation |
---|---|
bin | 1001000011011111… |
… | …0100011111011011 |
3 | 20021101111211120110 |
4 | 2100313310133123 |
5 | 14434210131102 |
6 | 1041103055403 |
7 | 114142231341 |
oct | 22067643733 |
9 | 6241454513 |
10 | 2430552027 |
11 | 1037a8a792 |
12 | 579ba1563 |
13 | 2c9724c87 |
14 | 190b33991 |
15 | e35ad86c |
hex | 90df47db |
2430552027 has 8 divisors (see below), whose sum is σ = 3248819280. Its totient is φ = 1616326400.
The previous prime is 2430552013. The next prime is 2430552041. The reversal of 2430552027 is 7202550342.
It is an interprime number because it is at equal distance from previous prime (2430552013) and next prime (2430552041).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2430552027 - 27 = 2430551899 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2430551985 and 2430552003.
It is not an unprimeable number, because it can be changed into a prime (2430552077) 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 7 ways as a sum of consecutive naturals, for example, 1009002 + ... + 1011407.
It is an arithmetic number, because the mean of its divisors is an integer number (406102410).
Almost surely, 22430552027 is an apocalyptic number.
2430552027 is a deficient number, since it is larger than the sum of its proper divisors (818267253).
2430552027 is a wasteful number, since it uses less digits than its factorization.
2430552027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2020813.
The product of its (nonzero) digits is 16800, while the sum is 30.
The square root of 2430552027 is about 49300.6290730656. The cubic root of 2430552027 is about 1344.5232210499.
The spelling of 2430552027 in words is "two billion, four hundred thirty million, five hundred fifty-two thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •