Base | Representation |
---|---|
bin | 1001100000000001… |
… | …00100101101100001 |
3 | 111011110100101102211 |
4 | 10300000210231201 |
5 | 40421202032113 |
6 | 2202035442121 |
7 | 240251613625 |
oct | 46000445541 |
9 | 14143311384 |
10 | 5100424033 |
11 | 2188069081 |
12 | ba4156341 |
13 | 6338c03b3 |
14 | 365563185 |
15 | 1ecb91b3d |
hex | 130024b61 |
5100424033 has 2 divisors, whose sum is σ = 5100424034. Its totient is φ = 5100424032.
The previous prime is 5100424009. The next prime is 5100424051. The reversal of 5100424033 is 3304240015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4806232929 + 294191104 = 69327^2 + 17152^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5100424033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5100423995 and 5100424013.
It is not a weakly prime, because it can be changed into another prime (5100424073) 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, 2550212016 + 2550212017.
It is an arithmetic number, because the mean of its divisors is an integer number (2550212017).
Almost surely, 25100424033 is an apocalyptic number.
It is an amenable number.
5100424033 is a deficient number, since it is larger than the sum of its proper divisors (1).
5100424033 is an equidigital number, since it uses as much as digits as its factorization.
5100424033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 22.
The square root of 5100424033 is about 71417.2530485456. The cubic root of 5100424033 is about 1721.3483245197.
Adding to 5100424033 its reverse (3304240015), we get a palindrome (8404664048).
The spelling of 5100424033 in words is "five billion, one hundred million, four hundred twenty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •