Base | Representation |
---|---|
bin | 1011110000110001011… |
… | …01111000001000111001 |
3 | 1102122011022201201120122 |
4 | 11320120231320020321 |
5 | 23110140222333213 |
6 | 505354325103025 |
7 | 41125001652266 |
oct | 5703055701071 |
9 | 1378138651518 |
10 | 404141605433 |
11 | 146439444905 |
12 | 663aa257a75 |
13 | 2c1586aca47 |
14 | 157bc25826d |
15 | a7a52e0d08 |
hex | 5e18b78239 |
404141605433 has 2 divisors, whose sum is σ = 404141605434. Its totient is φ = 404141605432.
The previous prime is 404141605429. The next prime is 404141605463. The reversal of 404141605433 is 334506141404.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 351449780224 + 52691825209 = 592832^2 + 229547^2 .
It is a cyclic number.
It is not a de Polignac number, because 404141605433 - 22 = 404141605429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 404141605393 and 404141605402.
It is not a weakly prime, because it can be changed into another prime (404141605463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 202070802716 + 202070802717.
It is an arithmetic number, because the mean of its divisors is an integer number (202070802717).
Almost surely, 2404141605433 is an apocalyptic number.
It is an amenable number.
404141605433 is a deficient number, since it is larger than the sum of its proper divisors (1).
404141605433 is an equidigital number, since it uses as much as digits as its factorization.
404141605433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 404141605433 its reverse (334506141404), we get a palindrome (738647746837).
The spelling of 404141605433 in words is "four hundred four billion, one hundred forty-one million, six hundred five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •