Base | Representation |
---|---|
bin | 1001101100101110… |
… | …10000001001100111 |
3 | 111102212221122122201 |
4 | 10312113100021213 |
5 | 41131000014143 |
6 | 2220404435331 |
7 | 243015021355 |
oct | 46627201147 |
9 | 14385848581 |
10 | 5207032423 |
11 | 223226358a |
12 | 10139a8b47 |
13 | 64ca08a98 |
14 | 3757947d5 |
15 | 2071ee64d |
hex | 1365d0267 |
5207032423 has 2 divisors, whose sum is σ = 5207032424. Its totient is φ = 5207032422.
The previous prime is 5207032393. The next prime is 5207032451. The reversal of 5207032423 is 3242307025.
It is an a-pointer prime, because the next prime (5207032451) can be obtained adding 5207032423 to its sum of digits (28).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5207032423 - 217 = 5206901351 is a prime.
It is a super-2 number, since 2×52070324232 = 54226373308346501858, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5207032391 and 5207032400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5207032483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2603516211 + 2603516212.
It is an arithmetic number, because the mean of its divisors is an integer number (2603516212).
Almost surely, 25207032423 is an apocalyptic number.
5207032423 is a deficient number, since it is larger than the sum of its proper divisors (1).
5207032423 is an equidigital number, since it uses as much as digits as its factorization.
5207032423 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10080, while the sum is 28.
The square root of 5207032423 is about 72159.7701146560. The cubic root of 5207032423 is about 1733.2588537236.
Adding to 5207032423 its reverse (3242307025), we get a palindrome (8449339448).
The spelling of 5207032423 in words is "five billion, two hundred seven million, thirty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •