Base | Representation |
---|---|
bin | 100111101101000001011… |
… | …0010010100110111011101 |
3 | 201022122221221222110112100 |
4 | 1033122002302110313131 |
5 | 1203401012442243134 |
6 | 15334453123355313 |
7 | 1102145441421612 |
oct | 117320262246735 |
9 | 21278857873470 |
10 | 5456802696669 |
11 | 1814242955675 |
12 | 741694222b39 |
13 | 30776092650c |
14 | 14c179916509 |
15 | 96e25d03999 |
hex | 4f682c94ddd |
5456802696669 has 12 divisors (see below), whose sum is σ = 7891767275392. Its totient is φ = 3633382801800.
The previous prime is 5456802696607. The next prime is 5456802696673. The reversal of 5456802696669 is 9666962086545.
It is not a de Polignac number, because 5456802696669 - 215 = 5456802663901 is a prime.
It is a super-2 number, since 2×54568026966692 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5456802696597 and 5456802696606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5456802686669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 373797517 + ... + 373812114.
Almost surely, 25456802696669 is an apocalyptic number.
It is an amenable number.
5456802696669 is a deficient number, since it is larger than the sum of its proper divisors (2434964578723).
5456802696669 is a wasteful number, since it uses less digits than its factorization.
5456802696669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 747610448 (or 747610445 counting only the distinct ones).
The product of its (nonzero) digits is 1007769600, while the sum is 72.
The spelling of 5456802696669 in words is "five trillion, four hundred fifty-six billion, eight hundred two million, six hundred ninety-six thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •