Base | Representation |
---|---|
bin | 11001011000111000000110… |
… | …001100111001100011001101 |
3 | 112122100122200122110220200210 |
4 | 121120320012030321203031 |
5 | 104113422014413244112 |
6 | 1033252111212313033 |
7 | 32343134225126334 |
oct | 3130700614714315 |
9 | 478318618426623 |
10 | 111660663806157 |
11 | 32640026805074 |
12 | 10634702472779 |
13 | 4a3c72b33078b |
14 | 1d80595316d1b |
15 | cd983b96cb3c |
hex | 658e063398cd |
111660663806157 has 64 divisors (see below), whose sum is σ = 154326686976000. Its totient is φ = 71766845337600.
The previous prime is 111660663806077. The next prime is 111660663806161. The reversal of 111660663806157 is 751608366066111.
It is a happy number.
It is not a de Polignac number, because 111660663806157 - 227 = 111660529588429 is a prime.
It is a super-2 number, since 2×1116606638061572 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111660663806097 and 111660663806106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111660663806257) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10745896432 + ... + 10745906822.
It is an arithmetic number, because the mean of its divisors is an integer number (2411354484000).
Almost surely, 2111660663806157 is an apocalyptic number.
It is an amenable number.
111660663806157 is a deficient number, since it is larger than the sum of its proper divisors (42666023169843).
111660663806157 is a wasteful number, since it uses less digits than its factorization.
111660663806157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12754.
The product of its (nonzero) digits is 6531840, while the sum is 57.
The spelling of 111660663806157 in words is "one hundred eleven trillion, six hundred sixty billion, six hundred sixty-three million, eight hundred six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •