Base | Representation |
---|---|
bin | 1001011001011101… |
… | …10010011111011001 |
3 | 111000121212102010102 |
4 | 10230232302133121 |
5 | 40313112231413 |
6 | 2152353025145 |
7 | 236013310064 |
oct | 45456623731 |
9 | 14017772112 |
10 | 5045430233 |
11 | 215a017458 |
12 | b898551b5 |
13 | 6253a6c9c |
14 | 35c1298db |
15 | 1e7e2c458 |
hex | 12cbb27d9 |
5045430233 has 2 divisors, whose sum is σ = 5045430234. Its totient is φ = 5045430232.
The previous prime is 5045430227. The next prime is 5045430251. The reversal of 5045430233 is 3320345405.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4876508224 + 168922009 = 69832^2 + 12997^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5045430233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5045430196 and 5045430205.
It is not a weakly prime, because it can be changed into another prime (5045430263) 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, 2522715116 + 2522715117.
It is an arithmetic number, because the mean of its divisors is an integer number (2522715117).
Almost surely, 25045430233 is an apocalyptic number.
It is an amenable number.
5045430233 is a deficient number, since it is larger than the sum of its proper divisors (1).
5045430233 is an equidigital number, since it uses as much as digits as its factorization.
5045430233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 29.
The square root of 5045430233 is about 71031.1919722596. The cubic root of 5045430233 is about 1715.1393136240.
Adding to 5045430233 its reverse (3320345405), we get a palindrome (8365775638).
The spelling of 5045430233 in words is "five billion, forty-five million, four hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •