Base | Representation |
---|---|
bin | 1001101000100… |
… | …1110110111000 |
3 | 2211001001212010 |
4 | 2122021312320 |
5 | 40321114202 |
6 | 4002045520 |
7 | 1000325010 |
oct | 232116670 |
9 | 84031763 |
10 | 40410552 |
11 | 208a1056 |
12 | 116498a0 |
13 | 84ab690 |
14 | 551cc40 |
15 | 383376c |
hex | 2689db8 |
40410552 has 64 divisors (see below), whose sum is σ = 124346880. Its totient is φ = 10657152.
The previous prime is 40410541. The next prime is 40410569. The reversal of 40410552 is 25501404.
40410552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7068 + ... + 11435.
It is an arithmetic number, because the mean of its divisors is an integer number (1942920).
Almost surely, 240410552 is an apocalyptic number.
40410552 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
40410552 is an abundant number, since it is smaller than the sum of its proper divisors (83936328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40410552 is a wasteful number, since it uses less digits than its factorization.
40410552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18532 (or 18528 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 21.
The square root of 40410552 is about 6356.9294474613. The cubic root of 40410552 is about 343.1612656716.
Adding to 40410552 its reverse (25501404), we get a palindrome (65911956).
The spelling of 40410552 in words is "forty million, four hundred ten thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •