Base | Representation |
---|---|
bin | 1011110000110000100… |
… | …01011001110011000001 |
3 | 1102122010210200111110122 |
4 | 11320120101121303001 |
5 | 23110131320003441 |
6 | 505353501110025 |
7 | 41124551343404 |
oct | 5703021316301 |
9 | 1378123614418 |
10 | 404134141121 |
11 | 146435206857 |
12 | 663a7858315 |
13 | 2c156c983a9 |
14 | 157bb273d3b |
15 | a7a481934b |
hex | 5e18459cc1 |
404134141121 has 2 divisors, whose sum is σ = 404134141122. Its totient is φ = 404134141120.
The previous prime is 404134141093. The next prime is 404134141123. The reversal of 404134141121 is 121141431404.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 298875423025 + 105258718096 = 546695^2 + 324436^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-404134141121 is a prime.
Together with 404134141123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (404134141123) 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, 202067070560 + 202067070561.
It is an arithmetic number, because the mean of its divisors is an integer number (202067070561).
Almost surely, 2404134141121 is an apocalyptic number.
It is an amenable number.
404134141121 is a deficient number, since it is larger than the sum of its proper divisors (1).
404134141121 is an equidigital number, since it uses as much as digits as its factorization.
404134141121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 404134141121 its reverse (121141431404), we get a palindrome (525275572525).
The spelling of 404134141121 in words is "four hundred four billion, one hundred thirty-four million, one hundred forty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •