Base | Representation |
---|---|
bin | 1001010111110110010011… |
… | …11000000110010001000101 |
3 | 2200222100122221101012011201 |
4 | 10223323021320012101011 |
5 | 10200141042320343412 |
6 | 111500221452502501 |
7 | 4225032605340043 |
oct | 453731170062105 |
9 | 80870587335151 |
10 | 20610640012357 |
11 | 6626a17a7237a |
12 | 238a59177aa31 |
13 | b667623c6635 |
14 | 5137bb665393 |
15 | 25b1e3d84e57 |
hex | 12bec9e06445 |
20610640012357 has 2 divisors, whose sum is σ = 20610640012358. Its totient is φ = 20610640012356.
The previous prime is 20610640012331. The next prime is 20610640012399. The reversal of 20610640012357 is 75321004601602.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11904162958081 + 8706477054276 = 3450241^2 + 2950674^2 .
It is a cyclic number.
It is not a de Polignac number, because 20610640012357 - 27 = 20610640012229 is a prime.
It is a super-2 number, since 2×206106400123572 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20610640012957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10305320006178 + 10305320006179.
It is an arithmetic number, because the mean of its divisors is an integer number (10305320006179).
Almost surely, 220610640012357 is an apocalyptic number.
It is an amenable number.
20610640012357 is a deficient number, since it is larger than the sum of its proper divisors (1).
20610640012357 is an equidigital number, since it uses as much as digits as its factorization.
20610640012357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 37.
Adding to 20610640012357 its reverse (75321004601602), we get a palindrome (95931644613959).
The spelling of 20610640012357 in words is "twenty trillion, six hundred ten billion, six hundred forty million, twelve thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •