Base | Representation |
---|---|
bin | 1001110101100101001010… |
… | …11001100011100110111110 |
3 | 2211121000120022121221220110 |
4 | 10322302211121203212332 |
5 | 10313410301420232000 |
6 | 114001413120530450 |
7 | 4361606555123151 |
oct | 472624531434676 |
9 | 84530508557813 |
10 | 21632230242750 |
11 | 69901a5025986 |
12 | 251457a180a26 |
13 | c0bbab661b1a |
14 | 54b011263c98 |
15 | 277a85c86850 |
hex | 13aca56639be |
21632230242750 has 128 divisors (see below), whose sum is σ = 54131015757312. Its totient is φ = 5753978630400.
The previous prime is 21632230242737. The next prime is 21632230242761. The reversal of 21632230242750 is 5724203223612.
It is a junction number, because it is equal to n+sod(n) for n = 21632230242699 and 21632230242708.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 519647437 + ... + 519689063.
It is an arithmetic number, because the mean of its divisors is an integer number (422898560604).
Almost surely, 221632230242750 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21632230242750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27065507878656).
21632230242750 is an abundant number, since it is smaller than the sum of its proper divisors (32498785514562).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21632230242750 is a wasteful number, since it uses less digits than its factorization.
21632230242750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43387 (or 43377 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 39.
The spelling of 21632230242750 in words is "twenty-one trillion, six hundred thirty-two billion, two hundred thirty million, two hundred forty-two thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •