Base | Representation |
---|---|
bin | 1101000010100111010… |
… | …1100110100010101110 |
3 | 210102021202012020012120 |
4 | 3100221311212202232 |
5 | 12132313243414000 |
6 | 250531143213410 |
7 | 22120632264330 |
oct | 3205165464256 |
9 | 712252166176 |
10 | 224040216750 |
11 | 87018952929 |
12 | 37506747266 |
13 | 18185a598bc |
14 | abb4bc9450 |
15 | 5c63c5b6a0 |
hex | 3429d668ae |
224040216750 has 128 divisors (see below), whose sum is σ = 643163728896. Its totient is φ = 50882832000.
The previous prime is 224040216749. The next prime is 224040216761. The reversal of 224040216750 is 57612040422.
224040216750 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 63 ways as a sum of consecutive naturals, for example, 688345 + ... + 960155.
It is an arithmetic number, because the mean of its divisors is an integer number (5024716632).
Almost surely, 2224040216750 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 224040216750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (321581864448).
224040216750 is an abundant number, since it is smaller than the sum of its proper divisors (419123512146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
224040216750 is a wasteful number, since it uses less digits than its factorization.
224040216750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271995 (or 271985 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 33.
The spelling of 224040216750 in words is "two hundred twenty-four billion, forty million, two hundred sixteen thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •