Base | Representation |
---|---|
bin | 100100011010110001101… |
… | …0000010111011001010001 |
3 | 122201111120010000110101121 |
4 | 1020311203100113121101 |
5 | 1124001324321244403 |
6 | 14351223135402241 |
7 | 1024423024105603 |
oct | 110654320273121 |
9 | 18644503013347 |
10 | 5005302134353 |
11 | 165a811626584 |
12 | 68a089683381 |
13 | 2a3cc86ba281 |
14 | 134387a15173 |
15 | 8a2ece593bd |
hex | 48d63417651 |
5005302134353 has 2 divisors, whose sum is σ = 5005302134354. Its totient is φ = 5005302134352.
The previous prime is 5005302134351. The next prime is 5005302134381. The reversal of 5005302134353 is 3534312035005.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3427045107984 + 1578257026369 = 1851228^2 + 1256287^2 .
It is a cyclic number.
It is not a de Polignac number, because 5005302134353 - 21 = 5005302134351 is a prime.
Together with 5005302134351, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (5005302134351) 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, 2502651067176 + 2502651067177.
It is an arithmetic number, because the mean of its divisors is an integer number (2502651067177).
Almost surely, 25005302134353 is an apocalyptic number.
It is an amenable number.
5005302134353 is a deficient number, since it is larger than the sum of its proper divisors (1).
5005302134353 is an equidigital number, since it uses as much as digits as its factorization.
5005302134353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81000, while the sum is 34.
Adding to 5005302134353 its reverse (3534312035005), we get a palindrome (8539614169358).
The spelling of 5005302134353 in words is "five trillion, five billion, three hundred two million, one hundred thirty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •