Base | Representation |
---|---|
bin | 11110000000111101101… |
… | …00011001111010101001 |
3 | 10122120222201012211201012 |
4 | 33000132310121322221 |
5 | 113344110124031121 |
6 | 2105435451233305 |
7 | 134336542414364 |
oct | 17003664317251 |
9 | 3576881184635 |
10 | 1031309205161 |
11 | 368415184164 |
12 | 147a5b448835 |
13 | 7633796c741 |
14 | 37cb66cb0db |
15 | 1bc6029cc5b |
hex | f01ed19ea9 |
1031309205161 has 2 divisors, whose sum is σ = 1031309205162. Its totient is φ = 1031309205160.
The previous prime is 1031309205149. The next prime is 1031309205167. The reversal of 1031309205161 is 1615029031301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 778375649536 + 252933555625 = 882256^2 + 502925^2 .
It is a cyclic number.
It is not a de Polignac number, because 1031309205161 - 218 = 1031308943017 is a prime.
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 (1031309205167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515654602580 + 515654602581.
It is an arithmetic number, because the mean of its divisors is an integer number (515654602581).
Almost surely, 21031309205161 is an apocalyptic number.
It is an amenable number.
1031309205161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031309205161 is an equidigital number, since it uses as much as digits as its factorization.
1031309205161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 32.
The spelling of 1031309205161 in words is "one trillion, thirty-one billion, three hundred nine million, two hundred five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •