Base | Representation |
---|---|
bin | 1001101010000… |
… | …0011110100000 |
3 | 2211012202221112 |
4 | 2122200132200 |
5 | 40332100300 |
6 | 4004042452 |
7 | 1001162063 |
oct | 232403640 |
9 | 84182845 |
10 | 40503200 |
11 | 20954721 |
12 | 11693428 |
13 | 85118ba |
14 | 55448da |
15 | 3850e35 |
hex | 26a07a0 |
40503200 has 72 divisors (see below), whose sum is σ = 99767052. Its totient is φ = 16056320.
The previous prime is 40503187. The next prime is 40503233. The reversal of 40503200 is 230504.
It can be written as a sum of positive squares in 6 ways, for example, as 37503376 + 2999824 = 6124^2 + 1732^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 157472 + ... + 157728.
Almost surely, 240503200 is an apocalyptic number.
40503200 is a gapful number since it is divisible by the number (40) 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 40503200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49883526).
40503200 is an abundant number, since it is smaller than the sum of its proper divisors (59263852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40503200 is a wasteful number, since it uses less digits than its factorization.
40503200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 474 (or 461 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 14.
The square root of 40503200 is about 6364.2124414573. The cubic root of 40503200 is about 343.4233171835.
Adding to 40503200 its reverse (230504), we get a palindrome (40733704).
It can be divided in two parts, 4050 and 3200, that multiplied together give a 4-th power (12960000 = 604).
The spelling of 40503200 in words is "forty million, five hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •