Base | Representation |
---|---|
bin | 10011001010111100100… |
… | …010111110100000000001 |
3 | 11122221111111022200111202 |
4 | 103022330202332200001 |
5 | 133041040324344311 |
6 | 2445114344550545 |
7 | 164115656045441 |
oct | 23127442764001 |
9 | 4587444280452 |
10 | 1317423278081 |
11 | 468797105969 |
12 | 1933aa482455 |
13 | 973039bc641 |
14 | 47a9956c121 |
15 | 2440885ce3b |
hex | 132bc8be801 |
1317423278081 has 2 divisors, whose sum is σ = 1317423278082. Its totient is φ = 1317423278080.
The previous prime is 1317423278053. The next prime is 1317423278159. The reversal of 1317423278081 is 1808723247131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1240904653681 + 76518624400 = 1113959^2 + 276620^2 .
It is an emirp because it is prime and its reverse (1808723247131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1317423278081 is a prime.
It is a super-2 number, since 2×13174232780812 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1317423278051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 658711639040 + 658711639041.
It is an arithmetic number, because the mean of its divisors is an integer number (658711639041).
Almost surely, 21317423278081 is an apocalyptic number.
It is an amenable number.
1317423278081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1317423278081 is an equidigital number, since it uses as much as digits as its factorization.
1317423278081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 451584, while the sum is 47.
The spelling of 1317423278081 in words is "one trillion, three hundred seventeen billion, four hundred twenty-three million, two hundred seventy-eight thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •