Base | Representation |
---|---|
bin | 100100110100100010111… |
… | …101001011101111001110 |
3 | 22221220012111122000000110 |
4 | 210310202331023233032 |
5 | 312424044440422200 |
6 | 5214225230140450 |
7 | 350544512561403 |
oct | 44644275135716 |
9 | 8856174560013 |
10 | 2530322201550 |
11 | 896115a10090 |
12 | 34a487951726 |
13 | 1547ba749530 |
14 | 8a67ac302aa |
15 | 45c45b81b50 |
hex | 24d22f4bbce |
2530322201550 has 192 divisors, whose sum is σ = 7398329976576. Its totient is φ = 564223795200.
The previous prime is 2530322201461. The next prime is 2530322201587. The reversal of 2530322201550 is 551022230352.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 5861934 + ... + 6278766.
It is an arithmetic number, because the mean of its divisors is an integer number (38532968628).
Almost surely, 22530322201550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2530322201550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3699164988288).
2530322201550 is an abundant number, since it is smaller than the sum of its proper divisors (4868007775026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2530322201550 is a wasteful number, since it uses less digits than its factorization.
2530322201550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417155 (or 417150 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
The spelling of 2530322201550 in words is "two trillion, five hundred thirty billion, three hundred twenty-two million, two hundred one thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •