Base | Representation |
---|---|
bin | 1010011010101111… |
… | …11001001010111101 |
3 | 112102210100201110021 |
4 | 11031113321022331 |
5 | 42423311421123 |
6 | 2322555012141 |
7 | 255413236141 |
oct | 51527711275 |
9 | 15383321407 |
10 | 5593076413 |
11 | 2410167101 |
12 | 110113a051 |
13 | 6b19a1c92 |
14 | 3b0b65221 |
15 | 22b057c5d |
hex | 14d5f92bd |
5593076413 has 2 divisors, whose sum is σ = 5593076414. Its totient is φ = 5593076412.
The previous prime is 5593076371. The next prime is 5593076431. The reversal of 5593076413 is 3146703955.
Together with next prime (5593076431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4047249924 + 1545826489 = 63618^2 + 39317^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5593076413 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5593076413.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5593071413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2796538206 + 2796538207.
It is an arithmetic number, because the mean of its divisors is an integer number (2796538207).
Almost surely, 25593076413 is an apocalyptic number.
It is an amenable number.
5593076413 is a deficient number, since it is larger than the sum of its proper divisors (1).
5593076413 is an equidigital number, since it uses as much as digits as its factorization.
5593076413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 340200, while the sum is 43.
The square root of 5593076413 is about 74786.8732666368. The cubic root of 5593076413 is about 1775.0758587430.
The spelling of 5593076413 in words is "five billion, five hundred ninety-three million, seventy-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •