Base | Representation |
---|---|
bin | 101101111011011111001110… |
… | …0111010111000000100010111 |
3 | 1221222110000222111002212212121 |
4 | 1123312332130322320010113 |
5 | 410423114242202141401 |
6 | 3551123034112400411 |
7 | 151045022060116645 |
oct | 13366763472700427 |
9 | 1858400874085777 |
10 | 404000141443351 |
11 | 1077aa5526457a2 |
12 | 39389b25b46107 |
13 | 1445708573a77b |
14 | 71a99d5686195 |
15 | 31a8e86727ca1 |
hex | 16f6f9ceb8117 |
404000141443351 has 2 divisors, whose sum is σ = 404000141443352. Its totient is φ = 404000141443350.
The previous prime is 404000141443309. The next prime is 404000141443399. The reversal of 404000141443351 is 153344141000404.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 404000141443351 - 215 = 404000141410583 is a prime.
It is a super-2 number, since 2×4040001414433512 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (404000142443351) 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, 202000070721675 + 202000070721676.
It is an arithmetic number, because the mean of its divisors is an integer number (202000070721676).
Almost surely, 2404000141443351 is an apocalyptic number.
404000141443351 is a deficient number, since it is larger than the sum of its proper divisors (1).
404000141443351 is an equidigital number, since it uses as much as digits as its factorization.
404000141443351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46080, while the sum is 34.
Adding to 404000141443351 its reverse (153344141000404), we get a palindrome (557344282443755).
The spelling of 404000141443351 in words is "four hundred four trillion, one hundred forty-one million, four hundred forty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •