Base | Representation |
---|---|
bin | 1001101010000… |
… | …0001110111101 |
3 | 2211012201120200 |
4 | 2122200032331 |
5 | 40332032310 |
6 | 4004034113 |
7 | 1001156142 |
oct | 232401675 |
9 | 84181520 |
10 | 40502205 |
11 | 209539a7 |
12 | 11692939 |
13 | 8511303 |
14 | 55443c9 |
15 | 38509c0 |
hex | 26a03bd |
40502205 has 48 divisors (see below), whose sum is σ = 74680320. Its totient is φ = 20248704.
The previous prime is 40502201. The next prime is 40502221. The reversal of 40502205 is 50220504.
40502205 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 40502205 - 22 = 40502201 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40502201) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 108399 + ... + 108771.
It is an arithmetic number, because the mean of its divisors is an integer number (1555840).
Almost surely, 240502205 is an apocalyptic number.
40502205 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
40502205 is a deficient number, since it is larger than the sum of its proper divisors (34178115).
40502205 is a wasteful number, since it uses less digits than its factorization.
40502205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530 (or 527 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 18.
The square root of 40502205 is about 6364.1342694824. The cubic root of 40502205 is about 343.4205049860.
Adding to 40502205 its reverse (50220504), we get a palindrome (90722709).
The spelling of 40502205 in words is "forty million, five hundred two thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •