Base | Representation |
---|---|
bin | 1001111100001001… |
… | …10011101100101001 |
3 | 111202220101222012122 |
4 | 10332010303230221 |
5 | 41412110240032 |
6 | 2241305521025 |
7 | 246145531163 |
oct | 47604635451 |
9 | 14686358178 |
10 | 5336415017 |
11 | 22992a364a |
12 | 104b1a3175 |
13 | 67076952b |
14 | 388a33933 |
15 | 21375a012 |
hex | 13e133b29 |
5336415017 has 2 divisors, whose sum is σ = 5336415018. Its totient is φ = 5336415016.
The previous prime is 5336415011. The next prime is 5336415053. The reversal of 5336415017 is 7105146335.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5029079056 + 307335961 = 70916^2 + 17531^2 .
It is a cyclic number.
It is not a de Polignac number, because 5336415017 - 26 = 5336414953 is a prime.
It is a super-2 number, since 2×53364150172 = 56954650467326220578, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5336415011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2668207508 + 2668207509.
It is an arithmetic number, because the mean of its divisors is an integer number (2668207509).
Almost surely, 25336415017 is an apocalyptic number.
It is an amenable number.
5336415017 is a deficient number, since it is larger than the sum of its proper divisors (1).
5336415017 is an equidigital number, since it uses as much as digits as its factorization.
5336415017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37800, while the sum is 35.
The square root of 5336415017 is about 73050.7701328330. The cubic root of 5336415017 is about 1747.4973770106.
The spelling of 5336415017 in words is "five billion, three hundred thirty-six million, four hundred fifteen thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •