Base | Representation |
---|---|
bin | 11010011000110000100110… |
… | …011001011111111011010101 |
3 | 120012220100001001212020210202 |
4 | 122120300212121133323111 |
5 | 110202333223100302001 |
6 | 1050452534254230245 |
7 | 33305245360615346 |
oct | 3230604631377325 |
9 | 505810031766722 |
10 | 116050660556501 |
11 | 33a828994a4560 |
12 | 1102348b4b5385 |
13 | 4c9a6b81acbb8 |
14 | 2092c4c08c0cd |
15 | d63b2602096b |
hex | 698c2665fed5 |
116050660556501 has 8 divisors (see below), whose sum is σ = 130684614820608. Its totient is φ = 102097355328000.
The previous prime is 116050660556491. The next prime is 116050660556539. The reversal of 116050660556501 is 105655066050611.
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 116050660556501 - 210 = 116050660555477 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116050660556561) 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, 170162258540 + ... + 170162259221.
It is an arithmetic number, because the mean of its divisors is an integer number (16335576852576).
Almost surely, 2116050660556501 is an apocalyptic number.
116050660556501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
116050660556501 is a deficient number, since it is larger than the sum of its proper divisors (14633954264107).
116050660556501 is a wasteful number, since it uses less digits than its factorization.
116050660556501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340324517803.
The product of its (nonzero) digits is 810000, while the sum is 47.
The spelling of 116050660556501 in words is "one hundred sixteen trillion, fifty billion, six hundred sixty million, five hundred fifty-six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •