Base | Representation |
---|---|
bin | 101101111101110110001011… |
… | …0100001101101010110110111 |
3 | 1222000121000200221112210220002 |
4 | 1123323230112201231112313 |
5 | 410443422133334312211 |
6 | 3551532004321501515 |
7 | 151110316115160200 |
oct | 13373542641552667 |
9 | 1860530627483802 |
10 | 404324304213431 |
11 | 107914a7a019868 |
12 | 394209134a189b |
13 | 1447b8064b5c64 |
14 | 71bb5878b45a7 |
15 | 31b260a32b03b |
hex | 16fbb1686d5b7 |
404324304213431 has 48 divisors (see below), whose sum is σ = 516632421945600. Its totient is φ = 314038991008512.
The previous prime is 404324304213367. The next prime is 404324304213493. The reversal of 404324304213431 is 134312403423404.
It is not a de Polignac number, because 404324304213431 - 26 = 404324304213367 is a prime.
It is a super-2 number, since 2×4043243042134312 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404324304213931) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 747878591 + ... + 748419023.
It is an arithmetic number, because the mean of its divisors is an integer number (10763175457200).
Almost surely, 2404324304213431 is an apocalyptic number.
404324304213431 is a deficient number, since it is larger than the sum of its proper divisors (112308117732169).
404324304213431 is a wasteful number, since it uses less digits than its factorization.
404324304213431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 575428 (or 575421 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 38.
Adding to 404324304213431 its reverse (134312403423404), we get a palindrome (538636707636835).
The spelling of 404324304213431 in words is "four hundred four trillion, three hundred twenty-four billion, three hundred four million, two hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •