Base | Representation |
---|---|
bin | 100110010011001111011… |
… | …0110101110000110110001 |
3 | 200122020022012211212002002 |
4 | 1030212132312232012301 |
5 | 1142221133010113403 |
6 | 15110125342303345 |
7 | 1052211554302415 |
oct | 114463666560661 |
9 | 20566265755062 |
10 | 5264000082353 |
11 | 174a4a48a5901 |
12 | 710246b87b55 |
13 | 2c251579064c |
14 | 142ac9692d45 |
15 | 91dde688188 |
hex | 4c99edae1b1 |
5264000082353 has 2 divisors, whose sum is σ = 5264000082354. Its totient is φ = 5264000082352.
The previous prime is 5264000082343. The next prime is 5264000082421. The reversal of 5264000082353 is 3532800004625.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4295641743649 + 968358338704 = 2072593^2 + 984052^2 .
It is a cyclic number.
It is not a de Polignac number, because 5264000082353 - 228 = 5263731646897 is a prime.
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 (5264000082343) 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, 2632000041176 + 2632000041177.
It is an arithmetic number, because the mean of its divisors is an integer number (2632000041177).
Almost surely, 25264000082353 is an apocalyptic number.
It is an amenable number.
5264000082353 is a deficient number, since it is larger than the sum of its proper divisors (1).
5264000082353 is an equidigital number, since it uses as much as digits as its factorization.
5264000082353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 172800, while the sum is 38.
Adding to 5264000082353 its reverse (3532800004625), we get a palindrome (8796800086978).
The spelling of 5264000082353 in words is "five trillion, two hundred sixty-four billion, eighty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •