Base | Representation |
---|---|
bin | 10110101101111011001… |
… | …101100111100011111011 |
3 | 12112020120112212222102102 |
4 | 112231323031213203323 |
5 | 201034203403432211 |
6 | 3153102234254015 |
7 | 220534340366126 |
oct | 26557315474373 |
9 | 5466515788372 |
10 | 1561140295931 |
11 | 552091aa8687 |
12 | 21268688730b |
13 | b42a41928c8 |
14 | 557b974b3bd |
15 | 2a91ec92a3b |
hex | 16b7b3678fb |
1561140295931 has 2 divisors, whose sum is σ = 1561140295932. Its totient is φ = 1561140295930.
The previous prime is 1561140295879. The next prime is 1561140295969. The reversal of 1561140295931 is 1395920411651.
It is a strong prime.
It is an emirp because it is prime and its reverse (1395920411651) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1561140295931 - 210 = 1561140294907 is a prime.
It is a super-2 number, since 2×15611402959312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1561140297931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 780570147965 + 780570147966.
It is an arithmetic number, because the mean of its divisors is an integer number (780570147966).
Almost surely, 21561140295931 is an apocalyptic number.
1561140295931 is a deficient number, since it is larger than the sum of its proper divisors (1).
1561140295931 is an equidigital number, since it uses as much as digits as its factorization.
1561140295931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 291600, while the sum is 47.
The spelling of 1561140295931 in words is "one trillion, five hundred sixty-one billion, one hundred forty million, two hundred ninety-five thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •