Base | Representation |
---|---|
bin | 101001010010001111001… |
… | …0110000001000000000001 |
3 | 202002110000000202112000001 |
4 | 1102210132112001000001 |
5 | 1220431140141321021 |
6 | 20022401252000001 |
7 | 1123641665512114 |
oct | 122443626010001 |
9 | 22073000675001 |
10 | 5674160885761 |
11 | 1898441993195 |
12 | 777835000001 |
13 | 3220c01cb4a4 |
14 | 1588b90b657b |
15 | 9c8e8105091 |
hex | 5291e581001 |
5674160885761 has 8 divisors (see below), whose sum is σ = 6232487929920. Its totient is φ = 5141802541392.
The previous prime is 5674160885753. The next prime is 5674160885797. The reversal of 5674160885761 is 1675880614765.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5674160885761 - 23 = 5674160885753 is a prime.
It is a super-2 number, since 2×56741608857612 (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 = 5674160885693 and 5674160885702.
It is not an unprimeable number, because it can be changed into a prime (5674160885711) 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, 6492174490 + ... + 6492175363.
It is an arithmetic number, because the mean of its divisors is an integer number (779060991240).
Almost surely, 25674160885761 is an apocalyptic number.
It is an amenable number.
5674160885761 is a deficient number, since it is larger than the sum of its proper divisors (558327044159).
5674160885761 is a wasteful number, since it uses less digits than its factorization.
5674160885761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12984349895.
The product of its (nonzero) digits is 67737600, while the sum is 64.
The spelling of 5674160885761 in words is "five trillion, six hundred seventy-four billion, one hundred sixty million, eight hundred eighty-five thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •