Base | Representation |
---|---|
bin | 1001101010000… |
… | …1000100000000 |
3 | 2211012220020102 |
4 | 2122201010000 |
5 | 40332134400 |
6 | 4004101532 |
7 | 1001202062 |
oct | 232410400 |
9 | 84186212 |
10 | 40505600 |
11 | 20956503 |
12 | 116948a8 |
13 | 8512a15 |
14 | 5545732 |
15 | 38519d5 |
hex | 26a1100 |
40505600 has 54 divisors (see below), whose sum is σ = 100273530. Its totient is φ = 16199680.
The previous prime is 40505567. The next prime is 40505617. The reversal of 40505600 is 650504.
It can be written as a sum of positive squares in 3 ways, for example, as 5837056 + 34668544 = 2416^2 + 5888^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3236 + ... + 9564.
Almost surely, 240505600 is an apocalyptic number.
40505600 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 40505600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50136765).
40505600 is an abundant number, since it is smaller than the sum of its proper divisors (59767930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40505600 is an equidigital number, since it uses as much as digits as its factorization.
40505600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6355 (or 6336 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 20.
The square root of 40505600 is about 6364.4009930236. The cubic root of 40505600 is about 343.4301001841.
The spelling of 40505600 in words is "forty million, five hundred five thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •