Base | Representation |
---|---|
bin | 100101100111011110111… |
… | …0100011100000010111001 |
3 | 200022020202022010011120201 |
4 | 1023032331310130002321 |
5 | 1134201210224003043 |
6 | 14555025031522201 |
7 | 1042344112304422 |
oct | 113167564340271 |
9 | 20266668104521 |
10 | 5170030297273 |
11 | 17136633584a6 |
12 | 6b5ba0829361 |
13 | 2b66bb39871a |
14 | 13c333468649 |
15 | 8e73ea53c4d |
hex | 4b3bdd1c0b9 |
5170030297273 has 2 divisors, whose sum is σ = 5170030297274. Its totient is φ = 5170030297272.
The previous prime is 5170030297219. The next prime is 5170030297303. The reversal of 5170030297273 is 3727920300715.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5169293337664 + 736959609 = 2273608^2 + 27147^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5170030297273 is a prime.
It is not a weakly prime, because it can be changed into another prime (5170030297673) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2585015148636 + 2585015148637.
It is an arithmetic number, because the mean of its divisors is an integer number (2585015148637).
Almost surely, 25170030297273 is an apocalyptic number.
It is an amenable number.
5170030297273 is a deficient number, since it is larger than the sum of its proper divisors (1).
5170030297273 is an equidigital number, since it uses as much as digits as its factorization.
5170030297273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 555660, while the sum is 46.
Adding to 5170030297273 its reverse (3727920300715), we get a palindrome (8897950597988).
The spelling of 5170030297273 in words is "five trillion, one hundred seventy billion, thirty million, two hundred ninety-seven thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.009 sec. • engine limits •