Base | Representation |
---|---|
bin | 100100110100101100010… |
… | …001110111001111000000 |
3 | 22221220121101221202102010 |
4 | 210310230101313033000 |
5 | 312424410011230121 |
6 | 5214252534452520 |
7 | 350551422232602 |
oct | 44645421671700 |
9 | 8856541852363 |
10 | 2530478617536 |
11 | 8961962347a1 |
12 | 34a510204140 |
13 | 154813c8387c |
14 | 8a693909172 |
15 | 45c5477c376 |
hex | 24d2c4773c0 |
2530478617536 has 112 divisors (see below), whose sum is σ = 6737153737248. Its totient is φ = 838215168000.
The previous prime is 2530478617501. The next prime is 2530478617547. The reversal of 2530478617536 is 6357168740352.
It is a super-2 number, since 2×25304786175362 (a number of 26 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 73755586 + ... + 73789886.
Almost surely, 22530478617536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2530478617536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3368576868624).
2530478617536 is an abundant number, since it is smaller than the sum of its proper divisors (4206675119712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2530478617536 is a wasteful number, since it uses less digits than its factorization.
2530478617536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36710 (or 36700 counting only the distinct ones).
The product of its (nonzero) digits is 25401600, while the sum is 57.
The spelling of 2530478617536 in words is "two trillion, five hundred thirty billion, four hundred seventy-eight million, six hundred seventeen thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •