Base | Representation |
---|---|
bin | 1011110100111111111… |
… | …00110001011100001001 |
3 | 1102212000102221011200220 |
4 | 11322133330301130021 |
5 | 23124312032344223 |
6 | 510411414020253 |
7 | 41235141456612 |
oct | 5723774613411 |
9 | 1385012834626 |
10 | 406410434313 |
11 | 1473a31055a4 |
12 | 66922047689 |
13 | 2c42a75cb40 |
14 | 159556d0c09 |
15 | a8895a66e3 |
hex | 5e9ff31709 |
406410434313 has 8 divisors (see below), whose sum is σ = 583563700608. Its totient is φ = 250098728784.
The previous prime is 406410434281. The next prime is 406410434317. The reversal of 406410434313 is 313434014604.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 406410434313 - 25 = 406410434281 is a prime.
It is a super-2 number, since 2×4064104343132 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (406410434317) 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 7 ways as a sum of consecutive naturals, for example, 5210390145 + ... + 5210390222.
It is an arithmetic number, because the mean of its divisors is an integer number (72945462576).
Almost surely, 2406410434313 is an apocalyptic number.
It is an amenable number.
406410434313 is a deficient number, since it is larger than the sum of its proper divisors (177153266295).
406410434313 is a wasteful number, since it uses less digits than its factorization.
406410434313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10420780383.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 406410434313 its reverse (313434014604), we get a palindrome (719844448917).
The spelling of 406410434313 in words is "four hundred six billion, four hundred ten million, four hundred thirty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •