Base | Representation |
---|---|
bin | 1001100010110000… |
… | …00000101010001001 |
3 | 111020001110220010202 |
4 | 10301120000222021 |
5 | 40443034020113 |
6 | 2204215021545 |
7 | 240650466662 |
oct | 46130005211 |
9 | 14201426122 |
10 | 5123345033 |
11 | 2199aa3a54 |
12 | bab96a8b5 |
13 | 638587211 |
14 | 36860c369 |
15 | 1eebbd258 |
hex | 131600a89 |
5123345033 has 2 divisors, whose sum is σ = 5123345034. Its totient is φ = 5123345032.
The previous prime is 5123345021. The next prime is 5123345039. The reversal of 5123345033 is 3305433215.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4983230464 + 140114569 = 70592^2 + 11837^2 .
It is a cyclic number.
It is not a de Polignac number, because 5123345033 - 26 = 5123344969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5123344987 and 5123345005.
It is not a weakly prime, because it can be changed into another prime (5123345039) 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, 2561672516 + 2561672517.
It is an arithmetic number, because the mean of its divisors is an integer number (2561672517).
Almost surely, 25123345033 is an apocalyptic number.
It is an amenable number.
5123345033 is a deficient number, since it is larger than the sum of its proper divisors (1).
5123345033 is an equidigital number, since it uses as much as digits as its factorization.
5123345033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 29.
The square root of 5123345033 is about 71577.5455921758. The cubic root of 5123345033 is about 1723.9230169354.
Adding to 5123345033 its reverse (3305433215), we get a palindrome (8428778248).
The spelling of 5123345033 in words is "five billion, one hundred twenty-three million, three hundred forty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •