Base | Representation |
---|---|
bin | 1010100110111000… |
… | …01101111000010101 |
3 | 112200212220112021021 |
4 | 11103130031320111 |
5 | 43130341414414 |
6 | 2341032521141 |
7 | 261060423412 |
oct | 52334157025 |
9 | 15625815237 |
10 | 5694873109 |
11 | 2462675502 |
12 | 112b2501b1 |
13 | 6c9ac4503 |
14 | 3c04a3109 |
15 | 234e64c24 |
hex | 15370de15 |
5694873109 has 2 divisors, whose sum is σ = 5694873110. Its totient is φ = 5694873108.
The previous prime is 5694873103. The next prime is 5694873113. The reversal of 5694873109 is 9013784965.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5338494225 + 356378884 = 73065^2 + 18878^2 .
It is a cyclic number.
It is not a de Polignac number, because 5694873109 - 25 = 5694873077 is a prime.
It is a super-2 number, since 2×56948731092 = 64863159455222651762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5694873103) 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, 2847436554 + 2847436555.
It is an arithmetic number, because the mean of its divisors is an integer number (2847436555).
Almost surely, 25694873109 is an apocalyptic number.
It is an amenable number.
5694873109 is a deficient number, since it is larger than the sum of its proper divisors (1).
5694873109 is an equidigital number, since it uses as much as digits as its factorization.
5694873109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 52.
The square root of 5694873109 is about 75464.3830492240. The cubic root of 5694873109 is about 1785.7802570331.
The spelling of 5694873109 in words is "five billion, six hundred ninety-four million, eight hundred seventy-three thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •