Base | Representation |
---|---|
bin | 10100011010001000001… |
… | …010100100000000001101 |
3 | 11222001221201110010220012 |
4 | 110122020022210000031 |
5 | 140434201103340111 |
6 | 2552135050003005 |
7 | 203215602454001 |
oct | 24321012440015 |
9 | 4861851403805 |
10 | 1402443808781 |
11 | 4a0855a71a74 |
12 | 1a7977716465 |
13 | a2332cc0b82 |
14 | 4bc42dd0701 |
15 | 2673298b48b |
hex | 146882a400d |
1402443808781 has 2 divisors, whose sum is σ = 1402443808782. Its totient is φ = 1402443808780.
The previous prime is 1402443808769. The next prime is 1402443808789. The reversal of 1402443808781 is 1878083442041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1034278830025 + 368164978756 = 1016995^2 + 606766^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1402443808781 is a prime.
It is a super-2 number, since 2×14024438087812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1402443808789) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 701221904390 + 701221904391.
It is an arithmetic number, because the mean of its divisors is an integer number (701221904391).
Almost surely, 21402443808781 is an apocalyptic number.
It is an amenable number.
1402443808781 is a deficient number, since it is larger than the sum of its proper divisors (1).
1402443808781 is an equidigital number, since it uses as much as digits as its factorization.
1402443808781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1376256, while the sum is 50.
The spelling of 1402443808781 in words is "one trillion, four hundred two billion, four hundred forty-three million, eight hundred eight thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •