Base | Representation |
---|---|
bin | 101101111101110000111010… |
… | …0110011110111100000100111 |
3 | 1222000112221112012210200101021 |
4 | 1123323201310303313200213 |
5 | 410443231011242130043 |
6 | 3551522454545312011 |
7 | 151106436035433226 |
oct | 13373416463674047 |
9 | 1860487465720337 |
10 | 404313001130023 |
11 | 1079101a97a0a17 |
12 | 3941a69a035607 |
13 | 1447a72485121b |
14 | 71babd466acbd |
15 | 31b2197d6e3ed |
hex | 16fb874cf7827 |
404313001130023 has 2 divisors, whose sum is σ = 404313001130024. Its totient is φ = 404313001130022.
The previous prime is 404313001129963. The next prime is 404313001130033. The reversal of 404313001130023 is 320031100313404.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 404313001130023 - 213 = 404313001121831 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 404313001130023.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (404313001130033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 202156500565011 + 202156500565012.
It is an arithmetic number, because the mean of its divisors is an integer number (202156500565012).
Almost surely, 2404313001130023 is an apocalyptic number.
404313001130023 is a deficient number, since it is larger than the sum of its proper divisors (1).
404313001130023 is an equidigital number, since it uses as much as digits as its factorization.
404313001130023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 404313001130023 its reverse (320031100313404), we get a palindrome (724344101443427).
The spelling of 404313001130023 in words is "four hundred four trillion, three hundred thirteen billion, one million, one hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •