Base | Representation |
---|---|
bin | 1001100010011001… |
… | …00000100110001011 |
3 | 111012211210201110102 |
4 | 10301030200212023 |
5 | 40441301030443 |
6 | 2204030240015 |
7 | 240613042106 |
oct | 46114404613 |
9 | 14184721412 |
10 | 5120330123 |
11 | 2198324897 |
12 | baa95600b |
13 | 637a6cb4c |
14 | 36806573d |
15 | 1ee7c4cb8 |
hex | 13132098b |
5120330123 has 2 divisors, whose sum is σ = 5120330124. Its totient is φ = 5120330122.
The previous prime is 5120330119. The next prime is 5120330143. The reversal of 5120330123 is 3210330215.
It is an a-pointer prime, because the next prime (5120330143) can be obtained adding 5120330123 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5120330123 - 22 = 5120330119 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 5120330095 and 5120330104.
It is not a weakly prime, because it can be changed into another prime (5120330143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2560165061 + 2560165062.
It is an arithmetic number, because the mean of its divisors is an integer number (2560165062).
Almost surely, 25120330123 is an apocalyptic number.
5120330123 is a deficient number, since it is larger than the sum of its proper divisors (1).
5120330123 is an equidigital number, since it uses as much as digits as its factorization.
5120330123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 5120330123 is about 71556.4820474008. The cubic root of 5120330123 is about 1723.5847943775.
Adding to 5120330123 its reverse (3210330215), we get a palindrome (8330660338).
The spelling of 5120330123 in words is "five billion, one hundred twenty million, three hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •