Base | Representation |
---|---|
bin | 1011110000100000100… |
… | …10001100010110011101 |
3 | 1102121210110112001101212 |
4 | 11320100102030112131 |
5 | 23104343013133321 |
6 | 505332312514205 |
7 | 41121333306644 |
oct | 5702022142635 |
9 | 1377713461355 |
10 | 404000130461 |
11 | 1463765a5644 |
12 | 6636a9ab965 |
13 | 2c1352a7245 |
14 | 157a754c35b |
15 | a797b9755b |
hex | 5e1048c59d |
404000130461 has 2 divisors, whose sum is σ = 404000130462. Its totient is φ = 404000130460.
The previous prime is 404000130427. The next prime is 404000130467. The reversal of 404000130461 is 164031000404.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 321510546361 + 82489584100 = 567019^2 + 287210^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-404000130461 is a prime.
It is a super-2 number, since 2×4040001304612 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (404000130467) 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 as a sum of consecutive naturals, namely, 202000065230 + 202000065231.
It is an arithmetic number, because the mean of its divisors is an integer number (202000065231).
Almost surely, 2404000130461 is an apocalyptic number.
It is an amenable number.
404000130461 is a deficient number, since it is larger than the sum of its proper divisors (1).
404000130461 is an equidigital number, since it uses as much as digits as its factorization.
404000130461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 404000130461 its reverse (164031000404), we get a palindrome (568031130865).
The spelling of 404000130461 in words is "four hundred four billion, one hundred thirty thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •