Base | Representation |
---|---|
bin | 100110011000111100101… |
… | …1000101101100000100001 |
3 | 200200101221101012021221001 |
4 | 1030301321120231200201 |
5 | 1142421233112013411 |
6 | 15115513445032001 |
7 | 1053124360036621 |
oct | 114617130554041 |
9 | 20611841167831 |
10 | 5276256360481 |
11 | 1754714188a87 |
12 | 7126a76b5601 |
13 | 2c3719a55322 |
14 | 14352d342881 |
15 | 923aa67cdc1 |
hex | 4cc7962d821 |
5276256360481 has 2 divisors, whose sum is σ = 5276256360482. Its totient is φ = 5276256360480.
The previous prime is 5276256360433. The next prime is 5276256360517. The reversal of 5276256360481 is 1840636526725.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5123957395456 + 152298965025 = 2263616^2 + 390255^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5276256360481 is a prime.
It is a super-2 number, since 2×52762563604812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5276256160481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2638128180240 + 2638128180241.
It is an arithmetic number, because the mean of its divisors is an integer number (2638128180241).
Almost surely, 25276256360481 is an apocalyptic number.
It is an amenable number.
5276256360481 is a deficient number, since it is larger than the sum of its proper divisors (1).
5276256360481 is an equidigital number, since it uses as much as digits as its factorization.
5276256360481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14515200, while the sum is 55.
The spelling of 5276256360481 in words is "five trillion, two hundred seventy-six billion, two hundred fifty-six million, three hundred sixty thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •