Base | Representation |
---|---|
bin | 11000011100000011… |
… | …00100101001100001 |
3 | 1020212100221222020102 |
4 | 30032001210221201 |
5 | 203332232221134 |
6 | 10005523152145 |
7 | 643062550604 |
oct | 141601445141 |
9 | 36770858212 |
10 | 13120195169 |
11 | 562300a904 |
12 | 2661b15655 |
13 | 13112666c3 |
14 | 8c66d633b |
15 | 51bc9537e |
hex | 30e064a61 |
13120195169 has 2 divisors, whose sum is σ = 13120195170. Its totient is φ = 13120195168.
The previous prime is 13120195159. The next prime is 13120195177. The reversal of 13120195169 is 96159102131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7774830625 + 5345364544 = 88175^2 + 73112^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13120195169 is a prime.
It is a super-2 number, since 2×131201951692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13120195129) 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, 6560097584 + 6560097585.
It is an arithmetic number, because the mean of its divisors is an integer number (6560097585).
Almost surely, 213120195169 is an apocalyptic number.
It is an amenable number.
13120195169 is a deficient number, since it is larger than the sum of its proper divisors (1).
13120195169 is an equidigital number, since it uses as much as digits as its factorization.
13120195169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 38.
The spelling of 13120195169 in words is "thirteen billion, one hundred twenty million, one hundred ninety-five thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •