Base | Representation |
---|---|
bin | 1001100001101011… |
… | …01011100101101001 |
3 | 111012102112200120001 |
4 | 10300311223211221 |
5 | 40433233031313 |
6 | 2203254103001 |
7 | 240511136152 |
oct | 46065534551 |
9 | 14172480501 |
10 | 5114345833 |
11 | 2194a077a3 |
12 | ba894aa61 |
13 | 63675604c |
14 | 367348929 |
15 | 1edee1add |
hex | 130d6b969 |
5114345833 has 2 divisors, whose sum is σ = 5114345834. Its totient is φ = 5114345832.
The previous prime is 5114345827. The next prime is 5114345879. The reversal of 5114345833 is 3385434115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4230591849 + 883753984 = 65043^2 + 29728^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5114345833 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5114345792 and 5114345801.
It is not a weakly prime, because it can be changed into another prime (5114345893) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2557172916 + 2557172917.
It is an arithmetic number, because the mean of its divisors is an integer number (2557172917).
Almost surely, 25114345833 is an apocalyptic number.
It is an amenable number.
5114345833 is a deficient number, since it is larger than the sum of its proper divisors (1).
5114345833 is an equidigital number, since it uses as much as digits as its factorization.
5114345833 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 86400, while the sum is 37.
The square root of 5114345833 is about 71514.6546730109. The cubic root of 5114345833 is about 1722.9130634618.
Adding to 5114345833 its reverse (3385434115), we get a palindrome (8499779948).
The spelling of 5114345833 in words is "five billion, one hundred fourteen million, three hundred forty-five thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •