Base | Representation |
---|---|
bin | 1001011010011001… |
… | …11110011001100001 |
3 | 111001011202102212001 |
4 | 10231030332121201 |
5 | 40322123441304 |
6 | 2153234404001 |
7 | 236140465246 |
oct | 45514763141 |
9 | 14034672761 |
10 | 5053343329 |
11 | 2163531701 |
12 | b90430601 |
13 | 626c179a8 |
14 | 35d1c95cd |
15 | 1e8991da4 |
hex | 12d33e661 |
5053343329 has 2 divisors, whose sum is σ = 5053343330. Its totient is φ = 5053343328.
The previous prime is 5053343327. The next prime is 5053343369. The reversal of 5053343329 is 9233433505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3558361104 + 1494982225 = 59652^2 + 38665^2 .
It is a cyclic number.
It is not a de Polignac number, because 5053343329 - 21 = 5053343327 is a prime.
Together with 5053343327, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (5053343327) 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, 2526671664 + 2526671665.
It is an arithmetic number, because the mean of its divisors is an integer number (2526671665).
Almost surely, 25053343329 is an apocalyptic number.
It is an amenable number.
5053343329 is a deficient number, since it is larger than the sum of its proper divisors (1).
5053343329 is an equidigital number, since it uses as much as digits as its factorization.
5053343329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145800, while the sum is 37.
The square root of 5053343329 is about 71086.8717063847. The cubic root of 5053343329 is about 1716.0355023373.
The spelling of 5053343329 in words is "five billion, fifty-three million, three hundred forty-three thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •