Base | Representation |
---|---|
bin | 100100110100100001101… |
… | …1000010000100000001101 |
3 | 122220210022001021222122011 |
4 | 1021221003120100200031 |
5 | 1130403103042012323 |
6 | 14432450341421221 |
7 | 1031421301321306 |
oct | 111510330204015 |
9 | 18823261258564 |
10 | 5060601907213 |
11 | 16812099353a6 |
12 | 69894140a811 |
13 | 2a929c437168 |
14 | 136d1215b7ad |
15 | 8b987c1c20d |
hex | 49a4361080d |
5060601907213 has 2 divisors, whose sum is σ = 5060601907214. Its totient is φ = 5060601907212.
The previous prime is 5060601907199. The next prime is 5060601907237. The reversal of 5060601907213 is 3127091060605.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4778867067844 + 281734839369 = 2186062^2 + 530787^2 .
It is a cyclic number.
It is not a de Polignac number, because 5060601907213 - 217 = 5060601776141 is a prime.
It is a super-3 number, since 3×50606019072133 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5060601907013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2530300953606 + 2530300953607.
It is an arithmetic number, because the mean of its divisors is an integer number (2530300953607).
Almost surely, 25060601907213 is an apocalyptic number.
It is an amenable number.
5060601907213 is a deficient number, since it is larger than the sum of its proper divisors (1).
5060601907213 is an equidigital number, since it uses as much as digits as its factorization.
5060601907213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 40.
Adding to 5060601907213 its reverse (3127091060605), we get a palindrome (8187692967818).
The spelling of 5060601907213 in words is "five trillion, sixty billion, six hundred one million, nine hundred seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •