Base | Representation |
---|---|
bin | 100101111110110011001… |
… | …1101110110100001001001 |
3 | 200111001000001022102121102 |
4 | 1023331212131312201021 |
5 | 1141011233204204103 |
6 | 15034025520551145 |
7 | 1046066024001425 |
oct | 113754635664111 |
9 | 20431001272542 |
10 | 5220104366153 |
11 | 17329199105a6 |
12 | 7038364824b5 |
13 | 2bb33b59cc91 |
14 | 140923959b85 |
15 | 90bc0b79e88 |
hex | 4bf66776849 |
5220104366153 has 2 divisors, whose sum is σ = 5220104366154. Its totient is φ = 5220104366152.
The previous prime is 5220104366149. The next prime is 5220104366171. The reversal of 5220104366153 is 3516634010225.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2797483714624 + 2422620651529 = 1672568^2 + 1556477^2 .
It is a cyclic number.
It is not a de Polignac number, because 5220104366153 - 22 = 5220104366149 is a prime.
It is a super-2 number, since 2×52201043661532 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5220104366123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2610052183076 + 2610052183077.
It is an arithmetic number, because the mean of its divisors is an integer number (2610052183077).
Almost surely, 25220104366153 is an apocalyptic number.
It is an amenable number.
5220104366153 is a deficient number, since it is larger than the sum of its proper divisors (1).
5220104366153 is an equidigital number, since it uses as much as digits as its factorization.
5220104366153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 129600, while the sum is 38.
Adding to 5220104366153 its reverse (3516634010225), we get a palindrome (8736738376378).
The spelling of 5220104366153 in words is "five trillion, two hundred twenty billion, one hundred four million, three hundred sixty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •