Base | Representation |
---|---|
bin | 10110111111010110111101… |
… | …010111010010000000001011 |
3 | 111021000010011120210111101111 |
4 | 112333112331113102000023 |
5 | 101223100313020041021 |
6 | 555013430401431151 |
7 | 30204012614240143 |
oct | 2677267527220013 |
9 | 437003146714344 |
10 | 101111002112011 |
11 | 2a242a31808821 |
12 | b40bba603b4b7 |
13 | 445595a407c68 |
14 | 1ad7b27579923 |
15 | ba51e10ca8e1 |
hex | 5bf5bd5d200b |
101111002112011 has 8 divisors (see below), whose sum is σ = 102143456427024. Its totient is φ = 100083697195680.
The previous prime is 101111002111963. The next prime is 101111002112093. The reversal of 101111002112011 is 110211200111101.
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 101111002112011 - 233 = 101102412177419 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101111002111982 and 101111002112000.
It is not an unprimeable number, because it can be changed into a prime (101111002110011) 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, 1287310200 + ... + 1287388741.
It is an arithmetic number, because the mean of its divisors is an integer number (12767932053378).
Almost surely, 2101111002112011 is an apocalyptic number.
101111002112011 is a deficient number, since it is larger than the sum of its proper divisors (1032454315013).
101111002112011 is a wasteful number, since it uses less digits than its factorization.
101111002112011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2574699341.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 101111002112011 its reverse (110211200111101), we get a palindrome (211322202223112).
The spelling of 101111002112011 in words is "one hundred one trillion, one hundred eleven billion, two million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •