Base | Representation |
---|---|
bin | 1001100110001… |
… | …0110000101111 |
3 | 2210201221012010 |
4 | 2121202300233 |
5 | 40301003130 |
6 | 3554412303 |
7 | 666060102 |
oct | 231426057 |
9 | 83657163 |
10 | 40250415 |
11 | 207a1807 |
12 | 11591093 |
13 | 845381a |
14 | 54ba739 |
15 | 38010b0 |
hex | 2662c2f |
40250415 has 8 divisors (see below), whose sum is σ = 64400688. Its totient is φ = 21466880.
The previous prime is 40250411. The next prime is 40250429. The reversal of 40250415 is 51405204.
40250415 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40250415 - 22 = 40250411 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 40250391 and 40250400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40250411) 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 7 ways as a sum of consecutive naturals, for example, 1341666 + ... + 1341695.
It is an arithmetic number, because the mean of its divisors is an integer number (8050086).
Almost surely, 240250415 is an apocalyptic number.
40250415 is a deficient number, since it is larger than the sum of its proper divisors (24150273).
40250415 is a wasteful number, since it uses less digits than its factorization.
40250415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2683369.
The product of its (nonzero) digits is 800, while the sum is 21.
The square root of 40250415 is about 6344.3214767223. The cubic root of 40250415 is about 342.7073779184.
Adding to 40250415 its reverse (51405204), we get a palindrome (91655619).
The spelling of 40250415 in words is "forty million, two hundred fifty thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •