Base | Representation |
---|---|
bin | 101001010000000011000… |
… | …0110011110011000001101 |
3 | 202001222212100200200201111 |
4 | 1102200012012132120031 |
5 | 1220342023023110214 |
6 | 20020302534212021 |
7 | 1123414324666114 |
oct | 122400606363015 |
9 | 22058770620644 |
10 | 5669459191309 |
11 | 1896449a025a1 |
12 | 7769424b4011 |
13 | 3218210c6374 |
14 | 1585908a6c7b |
15 | 9c7204755c4 |
hex | 5280619e60d |
5669459191309 has 2 divisors, whose sum is σ = 5669459191310. Its totient is φ = 5669459191308.
The previous prime is 5669459191303. The next prime is 5669459191337. The reversal of 5669459191309 is 9031919549665.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5545097168809 + 124362022500 = 2354803^2 + 352650^2 .
It is a cyclic number.
It is not a de Polignac number, because 5669459191309 - 29 = 5669459190797 is a prime.
It is a super-2 number, since 2×56694591913092 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5669459191303) 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, 2834729595654 + 2834729595655.
It is an arithmetic number, because the mean of its divisors is an integer number (2834729595655).
Almost surely, 25669459191309 is an apocalyptic number.
It is an amenable number.
5669459191309 is a deficient number, since it is larger than the sum of its proper divisors (1).
5669459191309 is an equidigital number, since it uses as much as digits as its factorization.
5669459191309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70858800, while the sum is 67.
The spelling of 5669459191309 in words is "five trillion, six hundred sixty-nine billion, four hundred fifty-nine million, one hundred ninety-one thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •