Base | Representation |
---|---|
bin | 10110111101110000001001… |
… | …001111111101010101001111 |
3 | 111020121120012220020120211100 |
4 | 112331300021033331111033 |
5 | 101214243220131023210 |
6 | 554451012104154143 |
7 | 30163024113562020 |
oct | 2675601117752517 |
9 | 436546186216740 |
10 | 101000606111055 |
11 | 2a2001310842a2 |
12 | b3b2716768953 |
13 | 4448415b69a81 |
14 | 1ad2653952c47 |
15 | ba23ce35e5c0 |
hex | 5bdc093fd54f |
101000606111055 has 24 divisors (see below), whose sum is σ = 200077391153952. Its totient is φ = 46171705650624.
The previous prime is 101000606110969. The next prime is 101000606111089. The reversal of 101000606111055 is 550111606000101.
101000606111055 is a `hidden beast` number, since 1 + 0 + 1 + 0 + 0 + 0 + 606 + 1 + 1 + 1 + 0 + 55 = 666.
It is not a de Polignac number, because 101000606111055 - 210 = 101000606110031 is a prime.
It is a super-2 number, since 2×1010006061110552 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 160318422084 + ... + 160318422713.
It is an arithmetic number, because the mean of its divisors is an integer number (8336557964748).
Almost surely, 2101000606111055 is an apocalyptic number.
101000606111055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
101000606111055 is a deficient number, since it is larger than the sum of its proper divisors (99076785042897).
101000606111055 is a wasteful number, since it uses less digits than its factorization.
101000606111055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320636844815 (or 320636844812 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
The spelling of 101000606111055 in words is "one hundred one trillion, six hundred six million, one hundred eleven thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •