Base | Representation |
---|---|
bin | 11000001010000… |
… | …111011111111101 |
3 | 1001020122122101221 |
4 | 120022013133331 |
5 | 1312224232331 |
6 | 104115033341 |
7 | 13021016140 |
oct | 3012073775 |
9 | 1036578357 |
10 | 405305341 |
11 | 1988699a1 |
12 | b389b851 |
13 | 65c7b35c |
14 | 3bb86057 |
15 | 258b0711 |
hex | 182877fd |
405305341 has 4 divisors (see below), whose sum is σ = 463206112. Its totient is φ = 347404572.
The previous prime is 405305339. The next prime is 405305413. The reversal of 405305341 is 143503504.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 405305341 - 21 = 405305339 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (405308341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28950375 + ... + 28950388.
It is an arithmetic number, because the mean of its divisors is an integer number (115801528).
Almost surely, 2405305341 is an apocalyptic number.
It is an amenable number.
405305341 is a deficient number, since it is larger than the sum of its proper divisors (57900771).
405305341 is an equidigital number, since it uses as much as digits as its factorization.
405305341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57900770.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 405305341 is about 20132.1966262999. The cubic root of 405305341 is about 740.0495103227.
Adding to 405305341 its reverse (143503504), we get a palindrome (548808845).
The spelling of 405305341 in words is "four hundred five million, three hundred five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •