Base | Representation |
---|---|
bin | 11000010110001011010101… |
… | …001010111101000010000001 |
3 | 112001010110201222102122110022 |
4 | 120112023111022331002001 |
5 | 103013322410420421323 |
6 | 1015422313514543225 |
7 | 31361031430045535 |
oct | 3026132512750201 |
9 | 461113658378408 |
10 | 107077111107713 |
11 | 311331697a900a |
12 | 10014317a37b15 |
13 | 4799436224456 |
14 | 1c627ba25dbc5 |
15 | c5a4c4a444c8 |
hex | 6162d52bd081 |
107077111107713 has 2 divisors, whose sum is σ = 107077111107714. Its totient is φ = 107077111107712.
The previous prime is 107077111107679. The next prime is 107077111107719. The reversal of 107077111107713 is 317701111770701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102230561693569 + 4846549414144 = 10110913^2 + 2201488^2 .
It is a cyclic number.
It is not a de Polignac number, because 107077111107713 - 26 = 107077111107649 is a prime.
It is a super-3 number, since 3×1070771111077133 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (107077111107719) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53538555553856 + 53538555553857.
It is an arithmetic number, because the mean of its divisors is an integer number (53538555553857).
Almost surely, 2107077111107713 is an apocalyptic number.
It is an amenable number.
107077111107713 is a deficient number, since it is larger than the sum of its proper divisors (1).
107077111107713 is an equidigital number, since it uses as much as digits as its factorization.
107077111107713 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 50421, while the sum is 44.
The spelling of 107077111107713 in words is "one hundred seven trillion, seventy-seven billion, one hundred eleven million, one hundred seven thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •