Base | Representation |
---|---|
bin | 1011110010111011110… |
… | …00111100011010001101 |
3 | 1102202011012110201001110 |
4 | 11321131320330122031 |
5 | 23120024321300123 |
6 | 510105423202233 |
7 | 41165523204561 |
oct | 5713570743215 |
9 | 1382135421043 |
10 | 405302134413 |
11 | 146984541470 |
12 | 66672a46379 |
13 | 2c2b1c64397 |
14 | 1588c4316a1 |
15 | a822131493 |
hex | 5e5de3c68d |
405302134413 has 64 divisors (see below), whose sum is σ = 620472213504. Its totient is φ = 232933272000.
The previous prime is 405302134361. The next prime is 405302134421. The reversal of 405302134413 is 314431203504.
It is not a de Polignac number, because 405302134413 - 28 = 405302134157 is a prime.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (405302134483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 199950706 + ... + 199952732.
It is an arithmetic number, because the mean of its divisors is an integer number (9694878336).
Almost surely, 2405302134413 is an apocalyptic number.
It is an amenable number.
405302134413 is a deficient number, since it is larger than the sum of its proper divisors (215170079091).
405302134413 is a wasteful number, since it uses less digits than its factorization.
405302134413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4206.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 405302134413 its reverse (314431203504), we get a palindrome (719733337917).
The spelling of 405302134413 in words is "four hundred five billion, three hundred two million, one hundred thirty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •