Base | Representation |
---|---|
bin | 1001110100000010… |
… | …11001010000101001 |
3 | 111121011110000211101 |
4 | 10322001121100221 |
5 | 41242203131213 |
6 | 2230440201401 |
7 | 244361521045 |
oct | 47201312051 |
9 | 14534400741 |
10 | 5268411433 |
11 | 226397653a |
12 | 1030469261 |
13 | 65c64961c |
14 | 37d9b1025 |
15 | 20c7c5bdd |
hex | 13a059429 |
5268411433 has 2 divisors, whose sum is σ = 5268411434. Its totient is φ = 5268411432.
The previous prime is 5268411403. The next prime is 5268411479. The reversal of 5268411433 is 3341148625.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3367713024 + 1900698409 = 58032^2 + 43597^2 .
It is a cyclic number.
It is not a de Polignac number, because 5268411433 - 29 = 5268410921 is a prime.
It is a super-2 number, since 2×52684114332 = 55512318054730226978, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5268411392 and 5268411401.
It is not a weakly prime, because it can be changed into another prime (5268411403) 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, 2634205716 + 2634205717.
It is an arithmetic number, because the mean of its divisors is an integer number (2634205717).
Almost surely, 25268411433 is an apocalyptic number.
It is an amenable number.
5268411433 is a deficient number, since it is larger than the sum of its proper divisors (1).
5268411433 is an equidigital number, since it uses as much as digits as its factorization.
5268411433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69120, while the sum is 37.
The square root of 5268411433 is about 72583.8234939439. The cubic root of 5268411433 is about 1740.0426546332.
The spelling of 5268411433 in words is "five billion, two hundred sixty-eight million, four hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •