Base | Representation |
---|---|
bin | 11000001001011… |
… | …011100100101111 |
3 | 1001020022111121022 |
4 | 120021123210233 |
5 | 1312203003143 |
6 | 104111124355 |
7 | 13016336453 |
oct | 3011334457 |
9 | 1036274538 |
10 | 405125423 |
11 | 1987567aa |
12 | b38136bb |
13 | 65c174b1 |
14 | 3bb3a663 |
15 | 25877268 |
hex | 1825b92f |
405125423 has 4 divisors (see below), whose sum is σ = 408842280. Its totient is φ = 401408568.
The previous prime is 405125401. The next prime is 405125431. The reversal of 405125423 is 324521504.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 405125423 - 28 = 405125167 is a prime.
It is a super-3 number, since 3×4051254233 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 405125392 and 405125401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (405125323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1858265 + ... + 1858482.
It is an arithmetic number, because the mean of its divisors is an integer number (102210570).
Almost surely, 2405125423 is an apocalyptic number.
405125423 is a deficient number, since it is larger than the sum of its proper divisors (3716857).
405125423 is a wasteful number, since it uses less digits than its factorization.
405125423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3716856.
The product of its (nonzero) digits is 4800, while the sum is 26.
The square root of 405125423 is about 20127.7277157656. The cubic root of 405125423 is about 739.9399896551.
Adding to 405125423 its reverse (324521504), we get a palindrome (729646927).
The spelling of 405125423 in words is "four hundred five million, one hundred twenty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •