Base | Representation |
---|---|
bin | 1001101111101… |
… | …0000110100001 |
3 | 2211220102112000 |
4 | 2123322012201 |
5 | 40430322210 |
6 | 4015554213 |
7 | 1004251260 |
oct | 233720641 |
9 | 84812460 |
10 | 40870305 |
11 | 21085513 |
12 | 1182b969 |
13 | 860ca18 |
14 | 55dc5d7 |
15 | 38c4ac0 |
hex | 26fa1a1 |
40870305 has 64 divisors (see below), whose sum is σ = 84518400. Its totient is φ = 18351360.
The previous prime is 40870289. The next prime is 40870331. The reversal of 40870305 is 50307804.
40870305 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 40870305 - 24 = 40870289 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon 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 63 ways as a sum of consecutive naturals, for example, 57291 + ... + 57999.
It is an arithmetic number, because the mean of its divisors is an integer number (1320600).
Almost surely, 240870305 is an apocalyptic number.
40870305 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
40870305 is an abundant number, since it is smaller than the sum of its proper divisors (43648095).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40870305 is a wasteful number, since it uses less digits than its factorization.
40870305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 791 (or 785 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 40870305 is about 6392.9887376719. The cubic root of 40870305 is about 344.4577493030.
The spelling of 40870305 in words is "forty million, eight hundred seventy thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •