Base | Representation |
---|---|
bin | 1001111011011010… |
… | …01101100101111101 |
3 | 111202110202201110012 |
4 | 10331231031211331 |
5 | 41404014322004 |
6 | 2240525153005 |
7 | 246042130034 |
oct | 47555154575 |
9 | 14673681405 |
10 | 5330229629 |
11 | 229585945a |
12 | 10490bb765 |
13 | 66c3b203a |
14 | 387ca371b |
15 | 212e3746e |
hex | 13db4d97d |
5330229629 has 2 divisors, whose sum is σ = 5330229630. Its totient is φ = 5330229628.
The previous prime is 5330229577. The next prime is 5330229631. The reversal of 5330229629 is 9269220335.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3407407129 + 1922822500 = 58373^2 + 43850^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5330229629 is a prime.
It is a super-2 number, since 2×53302296292 = 56822695795738955282, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 5330229631, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5330229659) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2665114814 + 2665114815.
It is an arithmetic number, because the mean of its divisors is an integer number (2665114815).
Almost surely, 25330229629 is an apocalyptic number.
It is an amenable number.
5330229629 is a deficient number, since it is larger than the sum of its proper divisors (1).
5330229629 is an equidigital number, since it uses as much as digits as its factorization.
5330229629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174960, while the sum is 41.
The square root of 5330229629 is about 73008.4216306585. The cubic root of 5330229629 is about 1746.8219467735.
The spelling of 5330229629 in words is "five billion, three hundred thirty million, two hundred twenty-nine thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •