Base | Representation |
---|---|
bin | 1001011011010011… |
… | …0010100111111101 |
3 | 20112100102201101101 |
4 | 2112310302213331 |
5 | 20140241434440 |
6 | 1055031413101 |
7 | 116464140262 |
oct | 22664624775 |
9 | 6470381341 |
10 | 2530421245 |
11 | 10893a1a30 |
12 | 5a7524191 |
13 | 3143210a1 |
14 | 1a00cd269 |
15 | ec23969a |
hex | 96d329fd |
2530421245 has 48 divisors (see below), whose sum is σ = 3583440000. Its totient is φ = 1699026560.
The previous prime is 2530421239. The next prime is 2530421251. The reversal of 2530421245 is 5421240352.
It is an interprime number because it is at equal distance from previous prime (2530421239) and next prime (2530421251).
It is not a de Polignac number, because 2530421245 - 23 = 2530421237 is a prime.
2530421245 is a modest number, since divided by 421245 gives 2530 as remainder.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 842256 + ... + 845254.
It is an arithmetic number, because the mean of its divisors is an integer number (74655000).
Almost surely, 22530421245 is an apocalyptic number.
It is an amenable number.
2530421245 is a deficient number, since it is larger than the sum of its proper divisors (1053018755).
2530421245 is a wasteful number, since it uses less digits than its factorization.
2530421245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3090 (or 3067 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 28.
The square root of 2530421245 is about 50303.2925860723. The cubic root of 2530421245 is about 1362.6916928058.
Adding to 2530421245 its reverse (5421240352), we get a palindrome (7951661597).
The spelling of 2530421245 in words is "two billion, five hundred thirty million, four hundred twenty-one thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •