Base | Representation |
---|---|
bin | 1001110000001100… |
… | …00101010111111101 |
3 | 111111220121202001002 |
4 | 10320012011113331 |
5 | 41210414230034 |
6 | 2223323300045 |
7 | 243516666431 |
oct | 47006052775 |
9 | 14456552032 |
10 | 5236086269 |
11 | 22476a8127 |
12 | 102167a625 |
13 | 655a3c1cb |
14 | 3795989c1 |
15 | 209a3ce7e |
hex | 1381855fd |
5236086269 has 2 divisors, whose sum is σ = 5236086270. Its totient is φ = 5236086268.
The previous prime is 5236086211. The next prime is 5236086283. The reversal of 5236086269 is 9626806325.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3322023769 + 1914062500 = 57637^2 + 43750^2 .
It is a cyclic number.
It is not a de Polignac number, because 5236086269 - 216 = 5236020733 is a prime.
It is a super-2 number, since 2×52360862692 = 54833198832820680722, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5236086299) 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, 2618043134 + 2618043135.
It is an arithmetic number, because the mean of its divisors is an integer number (2618043135).
Almost surely, 25236086269 is an apocalyptic number.
It is an amenable number.
5236086269 is a deficient number, since it is larger than the sum of its proper divisors (1).
5236086269 is an equidigital number, since it uses as much as digits as its factorization.
5236086269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 933120, while the sum is 47.
The square root of 5236086269 is about 72360.8061660454. The cubic root of 5236086269 is about 1736.4765831271.
The spelling of 5236086269 in words is "five billion, two hundred thirty-six million, eighty-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •