Base | Representation |
---|---|
bin | 100000100001100000111… |
… | …111000000101100000110 |
3 | 21220122221200212010200010 |
4 | 200201200333000230012 |
5 | 243104300042441200 |
6 | 4430425515331050 |
7 | 320321430414030 |
oct | 40414077005406 |
9 | 7818850763603 |
10 | 2235010124550 |
11 | 791953a48815 |
12 | 3011b0450a86 |
13 | 1329b6c10678 |
14 | 7a264554c50 |
15 | 3d20ed32150 |
hex | 20860fc0b06 |
2235010124550 has 192 divisors, whose sum is σ = 6497519846400. Its totient is φ = 497854855680.
The previous prime is 2235010124519. The next prime is 2235010124593. The reversal of 2235010124550 is 554210105322.
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 polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 8157079 + ... + 8426621.
It is an arithmetic number, because the mean of its divisors is an integer number (33841249200).
Almost surely, 22235010124550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2235010124550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3248759923200).
2235010124550 is an abundant number, since it is smaller than the sum of its proper divisors (4262509721850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2235010124550 is a wasteful number, since it uses less digits than its factorization.
2235010124550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269767 (or 269762 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 2235010124550 its reverse (554210105322), we get a palindrome (2789220229872).
The spelling of 2235010124550 in words is "two trillion, two hundred thirty-five billion, ten million, one hundred twenty-four thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •