Base | Representation |
---|---|
bin | 1001111010111110… |
… | …01100011110011001 |
3 | 111202012212000212001 |
4 | 10331133030132121 |
5 | 41402044230113 |
6 | 2240314321001 |
7 | 245665653652 |
oct | 47537143631 |
9 | 14665760761 |
10 | 5326555033 |
11 | 22937796a8 |
12 | 1047a29161 |
13 | 66b6c6617 |
14 | 3875c8529 |
15 | 21295d7dd |
hex | 13d7cc799 |
5326555033 has 2 divisors, whose sum is σ = 5326555034. Its totient is φ = 5326555032.
The previous prime is 5326555021. The next prime is 5326555103. The reversal of 5326555033 is 3305556235.
It is a happy number.
5326555033 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4892582809 + 433972224 = 69947^2 + 20832^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5326555033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5326554983 and 5326555001.
It is not a weakly prime, because it can be changed into another prime (5326555433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2663277516 + 2663277517.
It is an arithmetic number, because the mean of its divisors is an integer number (2663277517).
Almost surely, 25326555033 is an apocalyptic number.
It is an amenable number.
5326555033 is a deficient number, since it is larger than the sum of its proper divisors (1).
5326555033 is an equidigital number, since it uses as much as digits as its factorization.
5326555033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 202500, while the sum is 37.
The square root of 5326555033 is about 72983.2517294208. The cubic root of 5326555033 is about 1746.4204418366.
The spelling of 5326555033 in words is "five billion, three hundred twenty-six million, five hundred fifty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •