Base | Representation |
---|---|
bin | 101001001110010010000… |
… | …0101001001000010101101 |
3 | 202001122002002101010011000 |
4 | 1102130210011021002231 |
5 | 1220311241300102312 |
6 | 20014434354350513 |
7 | 1123221341345364 |
oct | 122344405110255 |
9 | 22048062333130 |
10 | 5665667190957 |
11 | 1894883475604 |
12 | 77606458b439 |
13 | 321368600187 |
14 | 1583110187db |
15 | 9c59c5d9adc |
hex | 527241490ad |
5665667190957 has 8 divisors (see below), whose sum is σ = 8393581023680. Its totient is φ = 3777111460620.
The previous prime is 5665667190929. The next prime is 5665667190977. The reversal of 5665667190957 is 7590917665665.
5665667190957 is a `hidden beast` number, since 5 + 6 + 6 + 566 + 7 + 1 + 9 + 0 + 9 + 57 = 666.
It is not a de Polignac number, because 5665667190957 - 228 = 5665398755501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5665667190977) 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 in 7 ways as a sum of consecutive naturals, for example, 104919762769 + ... + 104919762822.
It is an arithmetic number, because the mean of its divisors is an integer number (1049197627960).
Almost surely, 25665667190957 is an apocalyptic number.
It is an amenable number.
5665667190957 is a deficient number, since it is larger than the sum of its proper divisors (2727913832723).
5665667190957 is a wasteful number, since it uses less digits than its factorization.
5665667190957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209839525600 (or 209839525594 counting only the distinct ones).
The product of its (nonzero) digits is 642978000, while the sum is 72.
The spelling of 5665667190957 in words is "five trillion, six hundred sixty-five billion, six hundred sixty-seven million, one hundred ninety thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •