Base | Representation |
---|---|
bin | 1001100001010111… |
… | …01100000100010001 |
3 | 111012020121121022021 |
4 | 10300223230010101 |
5 | 40432100220403 |
6 | 2203122011441 |
7 | 240446646166 |
oct | 46053540421 |
9 | 14166547267 |
10 | 5111726353 |
11 | 2193488738 |
12 | ba7aa6b81 |
13 | 636049966 |
14 | 366c6606d |
15 | 1edb758bd |
hex | 130aec111 |
5111726353 has 2 divisors, whose sum is σ = 5111726354. Its totient is φ = 5111726352.
The previous prime is 5111726317. The next prime is 5111726359. The reversal of 5111726353 is 3536271115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3006109584 + 2105616769 = 54828^2 + 45887^2 .
It is a cyclic number.
It is not a de Polignac number, because 5111726353 - 29 = 5111725841 is a prime.
It is a super-2 number, since 2×51117263532 = 52259492615909361218, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5111726359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2555863176 + 2555863177.
It is an arithmetic number, because the mean of its divisors is an integer number (2555863177).
Almost surely, 25111726353 is an apocalyptic number.
It is an amenable number.
5111726353 is a deficient number, since it is larger than the sum of its proper divisors (1).
5111726353 is an equidigital number, since it uses as much as digits as its factorization.
5111726353 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18900, while the sum is 34.
The square root of 5111726353 is about 71496.3380390912. The cubic root of 5111726353 is about 1722.6188644123.
Adding to 5111726353 its reverse (3536271115), we get a palindrome (8647997468).
The spelling of 5111726353 in words is "five billion, one hundred eleven million, seven hundred twenty-six thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •