Base | Representation |
---|---|
bin | 100101111000100100110… |
… | …1110110001100010100101 |
3 | 200102202111110221012210202 |
4 | 1023301021232301202211 |
5 | 1140301344231023221 |
6 | 15023535255400245 |
7 | 1045113543223205 |
oct | 113611156614245 |
9 | 20382443835722 |
10 | 5206737361061 |
11 | 172818a556855 |
12 | 701125983085 |
13 | 2b9cbb16cc02 |
14 | 140016578405 |
15 | 9068c3d0d0b |
hex | 4bc49bb18a5 |
5206737361061 has 2 divisors, whose sum is σ = 5206737361062. Its totient is φ = 5206737361060.
The previous prime is 5206737360991. The next prime is 5206737361073. The reversal of 5206737361061 is 1601637376025.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4641374728225 + 565362632836 = 2154385^2 + 751906^2 .
It is a cyclic number.
It is not a de Polignac number, because 5206737361061 - 222 = 5206733166757 is a prime.
It is a super-2 number, since 2×52067373610612 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5206737360997 and 5206737361015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5206737364061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2603368680530 + 2603368680531.
It is an arithmetic number, because the mean of its divisors is an integer number (2603368680531).
Almost surely, 25206737361061 is an apocalyptic number.
It is an amenable number.
5206737361061 is a deficient number, since it is larger than the sum of its proper divisors (1).
5206737361061 is an equidigital number, since it uses as much as digits as its factorization.
5206737361061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 952560, while the sum is 47.
The spelling of 5206737361061 in words is "five trillion, two hundred six billion, seven hundred thirty-seven million, three hundred sixty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •