Base | Representation |
---|---|
bin | 10011011110010000100… |
… | …111010000000100001101 |
3 | 11201221000202002000112102 |
4 | 103132100213100010031 |
5 | 133411023211200311 |
6 | 2502424231044445 |
7 | 165451610100614 |
oct | 23362047200415 |
9 | 4657022060472 |
10 | 1338161037581 |
11 | 476569024585 |
12 | 197417510725 |
13 | 9925a197454 |
14 | 48aa581a87b |
15 | 24c1e25943b |
hex | 137909d010d |
1338161037581 has 2 divisors, whose sum is σ = 1338161037582. Its totient is φ = 1338161037580.
The previous prime is 1338161037503. The next prime is 1338161037611. The reversal of 1338161037581 is 1857301618331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 766428460681 + 571732576900 = 875459^2 + 756130^2 .
It is a cyclic number.
It is not a de Polignac number, because 1338161037581 - 222 = 1338156843277 is a prime.
It is a super-2 number, since 2×13381610375812 (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 (1338166037581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 669080518790 + 669080518791.
It is an arithmetic number, because the mean of its divisors is an integer number (669080518791).
Almost surely, 21338161037581 is an apocalyptic number.
It is an amenable number.
1338161037581 is a deficient number, since it is larger than the sum of its proper divisors (1).
1338161037581 is an equidigital number, since it uses as much as digits as its factorization.
1338161037581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 47.
The spelling of 1338161037581 in words is "one trillion, three hundred thirty-eight billion, one hundred sixty-one million, thirty-seven thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •