Base | Representation |
---|---|
bin | 1001101101111… |
… | …0011010101001 |
3 | 2211200122222000 |
4 | 2123132122221 |
5 | 40413210110 |
6 | 4013321213 |
7 | 1003266540 |
oct | 233363251 |
9 | 84618860 |
10 | 40756905 |
11 | 210082a2 |
12 | 11796209 |
13 | 85a0217 |
14 | 55ad157 |
15 | 38a11c0 |
hex | 26de6a9 |
40756905 has 128 divisors (see below), whose sum is σ = 91238400. Its totient is φ = 16837632.
The previous prime is 40756883. The next prime is 40756907. The reversal of 40756905 is 50965704.
It is not a de Polignac number, because 40756905 - 25 = 40756873 is a prime.
It is a super-2 number, since 2×407569052 = 3322250610358050, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 40756905.
It is not an unprimeable number, because it can be changed into a prime (40756907) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 690766 + ... + 690824.
It is an arithmetic number, because the mean of its divisors is an integer number (712800).
Almost surely, 240756905 is an apocalyptic number.
40756905 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
40756905 is an abundant number, since it is smaller than the sum of its proper divisors (50481495).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40756905 is a wasteful number, since it uses less digits than its factorization.
40756905 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140 (or 134 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 36.
The square root of 40756905 is about 6384.1134858334. The cubic root of 40756905 is about 344.1388731928.
The spelling of 40756905 in words is "forty million, seven hundred fifty-six thousand, nine hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •