Base | Representation |
---|---|
bin | 1001100111100111… |
… | …11010101100001101 |
3 | 111022220101022021012 |
4 | 10303303322230031 |
5 | 41034014340203 |
6 | 2212235015005 |
7 | 241655050364 |
oct | 46363725415 |
9 | 14286338235 |
10 | 5164215053 |
11 | 2210079228 |
12 | 100159a465 |
13 | 643b96a6a |
14 | 36dc0a7db |
15 | 203592bd8 |
hex | 133cfab0d |
5164215053 has 2 divisors, whose sum is σ = 5164215054. Its totient is φ = 5164215052.
The previous prime is 5164215037. The next prime is 5164215101. The reversal of 5164215053 is 3505124615.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2750163364 + 2414051689 = 52442^2 + 49133^2 .
It is a cyclic number.
It is not a de Polignac number, because 5164215053 - 24 = 5164215037 is a prime.
It is a super-2 number, since 2×51642150532 = 53338234227263585618, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5164215253) 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, 2582107526 + 2582107527.
It is an arithmetic number, because the mean of its divisors is an integer number (2582107527).
Almost surely, 25164215053 is an apocalyptic number.
It is an amenable number.
5164215053 is a deficient number, since it is larger than the sum of its proper divisors (1).
5164215053 is an equidigital number, since it uses as much as digits as its factorization.
5164215053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18000, while the sum is 32.
The square root of 5164215053 is about 71862.4731901150. The cubic root of 5164215053 is about 1728.4949157019.
Adding to 5164215053 its reverse (3505124615), we get a palindrome (8669339668).
The spelling of 5164215053 in words is "five billion, one hundred sixty-four million, two hundred fifteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •