Base | Representation |
---|---|
bin | 11000100000110100100100… |
… | …011001110101001010111001 |
3 | 112010201101210122022201021001 |
4 | 120200310210121311022321 |
5 | 103112313440210114212 |
6 | 1021142325151445001 |
7 | 31464625143206152 |
oct | 3040644431651271 |
9 | 463641718281231 |
10 | 107808584848057 |
11 | 31395400645665 |
12 | 10112038b26761 |
13 | 48203c9183092 |
14 | 1c89d6b5d8929 |
15 | c6e536cd4657 |
hex | 620d246752b9 |
107808584848057 has 4 divisors (see below), whose sum is σ = 108404212388836. Its totient is φ = 107212957307280.
The previous prime is 107808584848049. The next prime is 107808584848087. The reversal of 107808584848057 is 750848485808701.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 30274854103081 + 77533730744976 = 5502259^2 + 8805324^2 .
It is a cyclic number.
It is not a de Polignac number, because 107808584848057 - 23 = 107808584848049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (107808584848007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 297813770118 + ... + 297813770479.
It is an arithmetic number, because the mean of its divisors is an integer number (27101053097209).
Almost surely, 2107808584848057 is an apocalyptic number.
It is an amenable number.
107808584848057 is a deficient number, since it is larger than the sum of its proper divisors (595627540779).
107808584848057 is an equidigital number, since it uses as much as digits as its factorization.
107808584848057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 595627540778.
The product of its (nonzero) digits is 642252800, while the sum is 73.
The spelling of 107808584848057 in words is "one hundred seven trillion, eight hundred eight billion, five hundred eighty-four million, eight hundred forty-eight thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •