Base | Representation |
---|---|
bin | 10011001101111110010… |
… | …100011111001001111101 |
3 | 11200020220001121122201222 |
4 | 103031332110133021331 |
5 | 133114220102301311 |
6 | 2450413120443125 |
7 | 164262352661555 |
oct | 23157624371175 |
9 | 4606801548658 |
10 | 1320674259581 |
11 | 46a10520a436 |
12 | 193b571794a5 |
13 | 9770139b231 |
14 | 47cc7228165 |
15 | 24548e7badb |
hex | 1337e51f27d |
1320674259581 has 2 divisors, whose sum is σ = 1320674259582. Its totient is φ = 1320674259580.
The previous prime is 1320674259511. The next prime is 1320674259607. The reversal of 1320674259581 is 1859524760231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1316813625625 + 3860633956 = 1147525^2 + 62134^2 .
It is a cyclic number.
It is not a de Polignac number, because 1320674259581 - 226 = 1320607150717 is a prime.
It is a super-2 number, since 2×13206742595812 (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 (1320674259511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660337129790 + 660337129791.
It is an arithmetic number, because the mean of its divisors is an integer number (660337129791).
It is a 1-persistent number, because it is pandigital, but 2⋅1320674259581 = 2641348519162 is not.
Almost surely, 21320674259581 is an apocalyptic number.
It is an amenable number.
1320674259581 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320674259581 is an equidigital number, since it uses as much as digits as its factorization.
1320674259581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3628800, while the sum is 53.
The spelling of 1320674259581 in words is "one trillion, three hundred twenty billion, six hundred seventy-four million, two hundred fifty-nine thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •