Base | Representation |
---|---|
bin | 1001011110111101… |
… | …01010010110011001 |
3 | 111010211121201220222 |
4 | 10233132222112121 |
5 | 40411413043413 |
6 | 2201121125425 |
7 | 240113220062 |
oct | 45736522631 |
9 | 14124551828 |
10 | 5091534233 |
11 | 2183047035 |
12 | ba1189875 |
13 | 631ac9c66 |
14 | 3642cb569 |
15 | 1ebed7b08 |
hex | 12f7aa599 |
5091534233 has 2 divisors, whose sum is σ = 5091534234. Its totient is φ = 5091534232.
The previous prime is 5091534229. The next prime is 5091534241. The reversal of 5091534233 is 3324351905.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4430632969 + 660901264 = 66563^2 + 25708^2 .
It is a cyclic number.
It is not a de Polignac number, because 5091534233 - 22 = 5091534229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5091534193 and 5091534202.
It is not a weakly prime, because it can be changed into another prime (5091534223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2545767116 + 2545767117.
It is an arithmetic number, because the mean of its divisors is an integer number (2545767117).
Almost surely, 25091534233 is an apocalyptic number.
It is an amenable number.
5091534233 is a deficient number, since it is larger than the sum of its proper divisors (1).
5091534233 is an equidigital number, since it uses as much as digits as its factorization.
5091534233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 35.
The square root of 5091534233 is about 71354.9874430653. The cubic root of 5091534233 is about 1720.3476664479.
The spelling of 5091534233 in words is "five billion, ninety-one million, five hundred thirty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.489 sec. • engine limits •