Base | Representation |
---|---|
bin | 110111110110110110001100… |
… | …100010001011111100000011 |
3 | 1012012211000112102221022121011 |
4 | 313312312030202023330003 |
5 | 224144404430130420342 |
6 | 2230251214305341351 |
7 | 102513315341145253 |
oct | 6766661442137403 |
9 | 1165730472838534 |
10 | 245661602201347 |
11 | 71303556070082 |
12 | 23676a45637857 |
13 | a70ca35c2bcc7 |
14 | 44941292c7963 |
15 | 1d6034e584717 |
hex | df6d8c88bf03 |
245661602201347 has 2 divisors, whose sum is σ = 245661602201348. Its totient is φ = 245661602201346.
The previous prime is 245661602201341. The next prime is 245661602201359. The reversal of 245661602201347 is 743102206166542.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-245661602201347 is a prime.
It is a super-2 number, since 2×2456616022013472 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 245661602201347.
It is not a weakly prime, because it can be changed into another prime (245661602201341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122830801100673 + 122830801100674.
It is an arithmetic number, because the mean of its divisors is an integer number (122830801100674).
Almost surely, 2245661602201347 is an apocalyptic number.
245661602201347 is a deficient number, since it is larger than the sum of its proper divisors (1).
245661602201347 is an equidigital number, since it uses as much as digits as its factorization.
245661602201347 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2903040, while the sum is 49.
Adding to 245661602201347 its reverse (743102206166542), we get a palindrome (988763808367889).
The spelling of 245661602201347 in words is "two hundred forty-five trillion, six hundred sixty-one billion, six hundred two million, two hundred one thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •