Base | Representation |
---|---|
bin | 1001101011000… |
… | …0101100110000 |
3 | 2211100011002120 |
4 | 2122300230300 |
5 | 40341212043 |
6 | 4005314240 |
7 | 1001556600 |
oct | 232605460 |
9 | 84304076 |
10 | 40569648 |
11 | 2099a639 |
12 | 11705980 |
13 | 8535c12 |
14 | 5560c00 |
15 | 3865983 |
hex | 26b0b30 |
40569648 has 120 divisors (see below), whose sum is σ = 124849152. Its totient is φ = 11313792.
The previous prime is 40569647. The next prime is 40569703. The reversal of 40569648 is 84696504.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (40569647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 110361 + ... + 110727.
Almost surely, 240569648 is an apocalyptic number.
40569648 is a gapful number since it is divisible by the number (48) 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 40569648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62424576).
40569648 is an abundant number, since it is smaller than the sum of its proper divisors (84279504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40569648 is a wasteful number, since it uses less digits than its factorization.
40569648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439 (or 426 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 42.
The square root of 40569648 is about 6369.4307437949. The cubic root of 40569648 is about 343.6110169607.
The spelling of 40569648 in words is "forty million, five hundred sixty-nine thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •