Base | Representation |
---|---|
bin | 10100001110110011111… |
… | …111101111001100101111 |
3 | 11220220120222221110100002 |
4 | 110032303333233030233 |
5 | 140234310313013141 |
6 | 2542405315054515 |
7 | 202305534165302 |
oct | 24166377571457 |
9 | 4826528843302 |
10 | 1390294266671 |
11 | 496690961182 |
12 | 1a55468a143b |
13 | a1147b8a9bb |
14 | 4b40d5a6b39 |
15 | 2627102be9b |
hex | 143b3fef32f |
1390294266671 has 2 divisors, whose sum is σ = 1390294266672. Its totient is φ = 1390294266670.
The previous prime is 1390294266631. The next prime is 1390294266707. The reversal of 1390294266671 is 1766624920931.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1390294266671 is a prime.
It is a super-2 number, since 2×13902942666712 (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 (1390294266601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 695147133335 + 695147133336.
It is an arithmetic number, because the mean of its divisors is an integer number (695147133336).
Almost surely, 21390294266671 is an apocalyptic number.
1390294266671 is a deficient number, since it is larger than the sum of its proper divisors (1).
1390294266671 is an equidigital number, since it uses as much as digits as its factorization.
1390294266671 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5878656, while the sum is 56.
The spelling of 1390294266671 in words is "one trillion, three hundred ninety billion, two hundred ninety-four million, two hundred sixty-six thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •