Base | Representation |
---|---|
bin | 10111001111010011101100… |
… | …10011010000000001001001 |
3 | 20200221110002011201021122001 |
4 | 23213221312103100001021 |
5 | 23144234434421130031 |
6 | 300404343145031001 |
7 | 13523051336560651 |
oct | 1347516623200111 |
9 | 220843064637561 |
10 | 51103505645641 |
11 | 15312969742589 |
12 | 5894250785461 |
13 | 2269069893487 |
14 | c895cc4dd361 |
15 | 5d94bd285861 |
hex | 2e7a764d0049 |
51103505645641 has 2 divisors, whose sum is σ = 51103505645642. Its totient is φ = 51103505645640.
The previous prime is 51103505645617. The next prime is 51103505645719. The reversal of 51103505645641 is 14654650530115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 45026314327225 + 6077191318416 = 6710165^2 + 2465196^2 .
It is a cyclic number.
It is not a de Polignac number, because 51103505645641 - 217 = 51103505514569 is a prime.
It is a super-2 number, since 2×511035056456412 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51103505645591 and 51103505645600.
It is not a weakly prime, because it can be changed into another prime (51103505648641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25551752822820 + 25551752822821.
It is an arithmetic number, because the mean of its divisors is an integer number (25551752822821).
Almost surely, 251103505645641 is an apocalyptic number.
It is an amenable number.
51103505645641 is a deficient number, since it is larger than the sum of its proper divisors (1).
51103505645641 is an equidigital number, since it uses as much as digits as its factorization.
51103505645641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080000, while the sum is 46.
The spelling of 51103505645641 in words is "fifty-one trillion, one hundred three billion, five hundred five million, six hundred forty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •