Base | Representation |
---|---|
bin | 10010101100000011… |
… | …00111110001110000 |
3 | 221220020020101021220 |
4 | 21112001213301300 |
5 | 131021444401430 |
6 | 4335330145040 |
7 | 503426536440 |
oct | 112601476160 |
9 | 27806211256 |
10 | 10033200240 |
11 | 4289530928 |
12 | 1b40122180 |
13 | c3b842c9b |
14 | 6b2726120 |
15 | 3dac6a110 |
hex | 256067c70 |
10033200240 has 160 divisors (see below), whose sum is σ = 35704143360. Its totient is φ = 2283113472.
The previous prime is 10033200239. The next prime is 10033200311. The reversal of 10033200240 is 4200233001.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 368206 + ... + 394514.
It is an arithmetic number, because the mean of its divisors is an integer number (223150896).
Almost surely, 210033200240 is an apocalyptic number.
10033200240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10033200240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17852071680).
10033200240 is an abundant number, since it is smaller than the sum of its proper divisors (25670943120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10033200240 is a wasteful number, since it uses less digits than its factorization.
10033200240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26559 (or 26553 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 10033200240 its reverse (4200233001), we get a palindrome (14233433241).
The spelling of 10033200240 in words is "ten billion, thirty-three million, two hundred thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •