Base | Representation |
---|---|
bin | 100100110100101101100… |
… | …100100110000010000001 |
3 | 22221220122220202121001110 |
4 | 210310231210212002001 |
5 | 312424431034230100 |
6 | 5214255031353533 |
7 | 350552104460460 |
oct | 44645544460201 |
9 | 8856586677043 |
10 | 2530500305025 |
11 | 8961a74a7940 |
12 | 34a5175228a9 |
13 | 1548186080c4 |
14 | 8a6967529d7 |
15 | 45c56613250 |
hex | 24d2d926081 |
2530500305025 has 48 divisors (see below), whose sum is σ = 5216117004288. Its totient is φ = 1051636488000.
The previous prime is 2530500305009. The next prime is 2530500305071. The reversal of 2530500305025 is 5205030050352.
It is not a de Polignac number, because 2530500305025 - 24 = 2530500305009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2530500304983 and 2530500305001.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 219085161 + ... + 219096710.
It is an arithmetic number, because the mean of its divisors is an integer number (108669104256).
Almost surely, 22530500305025 is an apocalyptic number.
2530500305025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2530500305025 is an abundant number, since it is smaller than the sum of its proper divisors (2685616699263).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2530500305025 is a wasteful number, since it uses less digits than its factorization.
2530500305025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 438181902 (or 438181897 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 30.
Adding to 2530500305025 its reverse (5205030050352), we get a palindrome (7735530355377).
The spelling of 2530500305025 in words is "two trillion, five hundred thirty billion, five hundred million, three hundred five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •