Base | Representation |
---|---|
bin | 1001101010000… |
… | …0111101110000 |
3 | 2211012212200121 |
4 | 2122200331300 |
5 | 40332131300 |
6 | 4004100024 |
7 | 1001200651 |
oct | 232407560 |
9 | 84185617 |
10 | 40505200 |
11 | 2095617a |
12 | 11694614 |
13 | 8512798 |
14 | 5545528 |
15 | 385181a |
hex | 26a0f70 |
40505200 has 60 divisors (see below), whose sum is σ = 98183448. Its totient is φ = 16057600.
The previous prime is 40505173. The next prime is 40505209. The reversal of 40505200 is 250504.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40505209) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 52014 + ... + 52786.
Almost surely, 240505200 is an apocalyptic number.
40505200 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 40505200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49091724).
40505200 is an abundant number, since it is smaller than the sum of its proper divisors (57678248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40505200 is a wasteful number, since it uses less digits than its factorization.
40505200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 922 (or 911 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 16.
The square root of 40505200 is about 6364.3695681505. The cubic root of 40505200 is about 343.4289697026.
Adding to 40505200 its reverse (250504), we get a palindrome (40755704).
The spelling of 40505200 in words is "forty million, five hundred five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •