Base | Representation |
---|---|
bin | 10100111100100011… |
… | …011101000111100110 |
3 | 2011001102100011210000 |
4 | 110330203131013212 |
5 | 332030113420000 |
6 | 14155423042130 |
7 | 1424225223540 |
oct | 247443350746 |
9 | 64042304700 |
10 | 22490763750 |
11 | 95a14a4764 |
12 | 4438140346 |
13 | 2175722040 |
14 | 1135010690 |
15 | 8b9770000 |
hex | 53c8dd1e6 |
22490763750 has 400 divisors, whose sum is σ = 77539204512. Its totient is φ = 4743360000.
The previous prime is 22490763709. The next prime is 22490763803. The reversal of 22490763750 is 5736709422.
22490763750 is a `hidden beast` number, since 2 + 2 + 4 + 9 + 0 + 7 + 637 + 5 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 22490763696 and 22490763705.
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 199 ways as a sum of consecutive naturals, for example, 9212530 + ... + 9214970.
Almost surely, 222490763750 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22490763750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38769602256).
22490763750 is an abundant number, since it is smaller than the sum of its proper divisors (55048440762).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22490763750 is a wasteful number, since it uses less digits than its factorization.
22490763750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2495 (or 2471 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 45.
The spelling of 22490763750 in words is "twenty-two billion, four hundred ninety million, seven hundred sixty-three thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •