Base | Representation |
---|---|
bin | 100100110100010001010… |
… | …001100100010001001110 |
3 | 22221212102211102210111000 |
4 | 210310101101210101032 |
5 | 312422443020230042 |
6 | 5214135552041130 |
7 | 350534251246620 |
oct | 44642121442116 |
9 | 8855384383430 |
10 | 2530025555022 |
11 | 895a83517169 |
12 | 34a4045331a6 |
13 | 154771153c44 |
14 | 8a64d690c10 |
15 | 45c29ad674c |
hex | 24d1146444e |
2530025555022 has 512 divisors, whose sum is σ = 7095029760000. Its totient is φ = 652008268800.
The previous prime is 2530025555021. The next prime is 2530025555039. The reversal of 2530025555022 is 2205555200352.
2530025555022 is a `hidden beast` number, since 2 + 5 + 30 + 0 + 2 + 55 + 550 + 22 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2530025555021) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 8135130247 + ... + 8135130557.
It is an arithmetic number, because the mean of its divisors is an integer number (13857480000).
Almost surely, 22530025555022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2530025555022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3547514880000).
2530025555022 is an abundant number, since it is smaller than the sum of its proper divisors (4565004204978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2530025555022 is a wasteful number, since it uses less digits than its factorization.
2530025555022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 797 (or 791 counting only the distinct ones).
The product of its (nonzero) digits is 150000, while the sum is 36.
The spelling of 2530025555022 in words is "two trillion, five hundred thirty billion, twenty-five million, five hundred fifty-five thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •