Base | Representation |
---|---|
bin | 1011110000111001101… |
… | …11110100011001101111 |
3 | 1102122100011220121120121 |
4 | 11320130313310121233 |
5 | 23110311044223211 |
6 | 505405255225411 |
7 | 41126506351102 |
oct | 5703467643157 |
9 | 1378304817517 |
10 | 404211320431 |
11 | 146474830806 |
12 | 66409678267 |
13 | 2c169c7b919 |
14 | 157c7604739 |
15 | a7ab4b2271 |
hex | 5e1cdf466f |
404211320431 has 4 divisors (see below), whose sum is σ = 404262879264. Its totient is φ = 404159761600.
The previous prime is 404211320407. The next prime is 404211320441. The reversal of 404211320431 is 134023112404.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 404211320431 - 233 = 395621385839 is a prime.
It is a super-2 number, since 2×4042113204312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 404211320396 and 404211320405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404211320441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25767655 + ... + 25783336.
It is an arithmetic number, because the mean of its divisors is an integer number (101065719816).
Almost surely, 2404211320431 is an apocalyptic number.
404211320431 is a deficient number, since it is larger than the sum of its proper divisors (51558833).
404211320431 is an equidigital number, since it uses as much as digits as its factorization.
404211320431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51558832.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 404211320431 its reverse (134023112404), we get a palindrome (538234432835).
The spelling of 404211320431 in words is "four hundred four billion, two hundred eleven million, three hundred twenty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •