Base | Representation |
---|---|
bin | 101001010000000011101… |
… | …0111000010001001111001 |
3 | 202001222220211102121020212 |
4 | 1102200013113002021321 |
5 | 1220342043424344434 |
6 | 20020305011000505 |
7 | 1123415002332602 |
oct | 122400727021171 |
9 | 22058824377225 |
10 | 5669480309369 |
11 | 189645a916938 |
12 | 776949599135 |
13 | 3218255ab666 |
14 | 158593602da9 |
15 | 9c7222478ce |
hex | 528075c2279 |
5669480309369 has 8 divisors (see below), whose sum is σ = 5680869304320. Its totient is φ = 5658091782336.
The previous prime is 5669480309327. The next prime is 5669480309413. The reversal of 5669480309369 is 9639030849665.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5669480309369 is a prime.
It is a super-2 number, since 2×56694803093692 (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 = 5669480309299 and 5669480309308.
It is not an unprimeable number, because it can be changed into a prime (5669480209369) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34226504 + ... + 34391750.
It is an arithmetic number, because the mean of its divisors is an integer number (710108663040).
Almost surely, 25669480309369 is an apocalyptic number.
It is an amenable number.
5669480309369 is a deficient number, since it is larger than the sum of its proper divisors (11388994951).
5669480309369 is a wasteful number, since it uses less digits than its factorization.
5669480309369 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233959.
The product of its (nonzero) digits is 226748160, while the sum is 68.
The spelling of 5669480309369 in words is "five trillion, six hundred sixty-nine billion, four hundred eighty million, three hundred nine thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •