Base | Representation |
---|---|
bin | 10110111111010110000100… |
… | …111110100100101111010011 |
3 | 111021000000201122201200001012 |
4 | 112333112010332210233103 |
5 | 101223041343331023214 |
6 | 555013152445401135 |
7 | 30203650306330652 |
oct | 2677260476445723 |
9 | 437000648650035 |
10 | 101110056111059 |
11 | 2a242596817256 |
12 | b40b9812691ab |
13 | 4455839426498 |
14 | 1ad7a77a87199 |
15 | ba518801403e |
hex | 5bf584fa4bd3 |
101110056111059 has 48 divisors (see below), whose sum is σ = 108438999588864. Its totient is φ = 94224506640000.
The previous prime is 101110056111047. The next prime is 101110056111083. The reversal of 101110056111059 is 950111650011101.
It is a de Polignac number, because none of the positive numbers 2k-101110056111059 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101110056111019) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 14234834702 + ... + 14234841804.
It is an arithmetic number, because the mean of its divisors is an integer number (2259145824768).
Almost surely, 2101110056111059 is an apocalyptic number.
101110056111059 is a deficient number, since it is larger than the sum of its proper divisors (7328943477805).
101110056111059 is a wasteful number, since it uses less digits than its factorization.
101110056111059 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9728 (or 9705 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 32.
The spelling of 101110056111059 in words is "one hundred one trillion, one hundred ten billion, fifty-six million, one hundred eleven thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •