Base | Representation |
---|---|
bin | 11000001010100… |
… | …001111000111001 |
3 | 1001020212010200100 |
4 | 120022201320321 |
5 | 1312241212213 |
6 | 104121230013 |
7 | 13021646235 |
oct | 3012417071 |
9 | 1036763610 |
10 | 405413433 |
11 | 198933127 |
12 | b3932309 |
13 | 65cb8609 |
14 | 3bbb35c5 |
15 | 258d2773 |
hex | 182a1e39 |
405413433 has 36 divisors (see below), whose sum is σ = 648304020. Its totient is φ = 243268608.
The previous prime is 405413389. The next prime is 405413447. The reversal of 405413433 is 334314504.
It can be written as a sum of positive squares in 2 ways, for example, as 256256064 + 149157369 = 16008^2 + 12213^2 .
It is not a de Polignac number, because 405413433 - 29 = 405412921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 405413397 and 405413406.
It is not an unprimeable number, because it can be changed into a prime (405413233) 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 35 ways as a sum of consecutive naturals, for example, 78433 + ... + 83441.
It is an arithmetic number, because the mean of its divisors is an integer number (18008445).
Almost surely, 2405413433 is an apocalyptic number.
It is an amenable number.
405413433 is a deficient number, since it is larger than the sum of its proper divisors (242890587).
405413433 is a wasteful number, since it uses less digits than its factorization.
405413433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5078 (or 5052 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 27.
The square root of 405413433 is about 20134.8810028766. The cubic root of 405413433 is about 740.1152930905.
Adding to 405413433 its reverse (334314504), we get a palindrome (739727937).
The spelling of 405413433 in words is "four hundred five million, four hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •