Base | Representation |
---|---|
bin | 11000001001110… |
… | …110000111010011 |
3 | 1001020112000201112 |
4 | 120021312013103 |
5 | 1312214443011 |
6 | 104113323535 |
7 | 13020301421 |
oct | 3011660723 |
9 | 1036460645 |
10 | 405234131 |
11 | 198820445 |
12 | b38665ab |
13 | 65c54b13 |
14 | 3bb68111 |
15 | 2589958b |
hex | 182761d3 |
405234131 has 8 divisors (see below), whose sum is σ = 413197200. Its totient is φ = 397282912.
The previous prime is 405234127. The next prime is 405234143. The reversal of 405234131 is 131432504.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 405234131 - 22 = 405234127 is a prime.
It is a super-2 number, since 2×4052341312 = 328429401854650322, 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 = 405234097 and 405234106.
It is not an unprimeable number, because it can be changed into a prime (405234191) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 101336 + ... + 105258.
It is an arithmetic number, because the mean of its divisors is an integer number (51649650).
Almost surely, 2405234131 is an apocalyptic number.
405234131 is a deficient number, since it is larger than the sum of its proper divisors (7963069).
405234131 is a wasteful number, since it uses less digits than its factorization.
405234131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5925.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 405234131 is about 20130.4279884954. The cubic root of 405234131 is about 740.0061668588.
Adding to 405234131 its reverse (131432504), we get a palindrome (536666635).
It can be divided in two parts, 4052 and 34131, that added together give a palindrome (38183).
The spelling of 405234131 in words is "four hundred five million, two hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •