Base | Representation |
---|---|
bin | 11000001001000… |
… | …001010110101111 |
3 | 1001020010001021211 |
4 | 120021001112233 |
5 | 1312141034111 |
6 | 104104535251 |
7 | 13015411405 |
oct | 3011012657 |
9 | 1036101254 |
10 | 405018031 |
11 | 198693050 |
12 | b3781527 |
13 | 65baa652 |
14 | 3bb0d475 |
15 | 25855521 |
hex | 182415af |
405018031 has 12 divisors (see below), whose sum is σ = 457609464. Its totient is φ = 355493600.
The previous prime is 405018011. The next prime is 405018059. The reversal of 405018031 is 130810504.
It is not a de Polignac number, because 405018031 - 29 = 405017519 is a prime.
It is a super-2 number, since 2×4050180312 = 328079210870233922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 405017993 and 405018011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (405018001) 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 11 ways as a sum of consecutive naturals, for example, 12640 + ... + 31141.
It is an arithmetic number, because the mean of its divisors is an integer number (38134122).
Almost surely, 2405018031 is an apocalyptic number.
405018031 is a deficient number, since it is larger than the sum of its proper divisors (52591433).
405018031 is a wasteful number, since it uses less digits than its factorization.
405018031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43850 (or 43821 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 22.
The square root of 405018031 is about 20125.0597763087. The cubic root of 405018031 is about 739.8746019559.
Adding to 405018031 its reverse (130810504), we get a palindrome (535828535).
The spelling of 405018031 in words is "four hundred five million, eighteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •