Base | Representation |
---|---|
bin | 1001100000100001… |
… | …01000001001110001 |
3 | 111011202021012021111 |
4 | 10300100220021301 |
5 | 40423241214213 |
6 | 2202305553321 |
7 | 240332442205 |
oct | 46020501161 |
9 | 14152235244 |
10 | 5104632433 |
11 | 218a48299a |
12 | ba5645841 |
13 | 634734a84 |
14 | 365d3ab05 |
15 | 1ed223a3d |
hex | 130428271 |
5104632433 has 2 divisors, whose sum is σ = 5104632434. Its totient is φ = 5104632432.
The previous prime is 5104632413. The next prime is 5104632437. The reversal of 5104632433 is 3342364015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5088254224 + 16378209 = 71332^2 + 4047^2 .
It is a cyclic number.
It is not a de Polignac number, because 5104632433 - 213 = 5104624241 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5104632395 and 5104632404.
It is not a weakly prime, because it can be changed into another prime (5104632437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2552316216 + 2552316217.
It is an arithmetic number, because the mean of its divisors is an integer number (2552316217).
Almost surely, 25104632433 is an apocalyptic number.
It is an amenable number.
5104632433 is a deficient number, since it is larger than the sum of its proper divisors (1).
5104632433 is an equidigital number, since it uses as much as digits as its factorization.
5104632433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 31.
The square root of 5104632433 is about 71446.7104421190. The cubic root of 5104632433 is about 1721.8216270504.
Adding to 5104632433 its reverse (3342364015), we get a palindrome (8446996448).
The spelling of 5104632433 in words is "five billion, one hundred four million, six hundred thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •