Base | Representation |
---|---|
bin | 10110111111010110000111… |
… | …100110000100101100101011 |
3 | 111021000000211201100110210200 |
4 | 112333112013212010230223 |
5 | 101223041441101120021 |
6 | 555013201054443243 |
7 | 30203651351466255 |
oct | 2677260746045453 |
9 | 437000751313720 |
10 | 101110100020011 |
11 | 2a242609587745 |
12 | b40b993b03523 |
13 | 445584555b304 |
14 | 1ad7a7d836cd5 |
15 | ba518bcd9126 |
hex | 5bf587984b2b |
101110100020011 has 24 divisors (see below), whose sum is σ = 146468240100000. Its totient is φ = 67212745356672.
The previous prime is 101110100020009. The next prime is 101110100020043. The reversal of 101110100020011 is 110020001011101.
It is not a de Polignac number, because 101110100020011 - 21 = 101110100020009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 101110100019975 and 101110100020002.
It is not an unprimeable number, because it can be changed into a prime (101110100021011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 341118370 + ... + 341414648.
It is an arithmetic number, because the mean of its divisors is an integer number (6102843337500).
Almost surely, 2101110100020011 is an apocalyptic number.
101110100020011 is a deficient number, since it is larger than the sum of its proper divisors (45358140079989).
101110100020011 is a wasteful number, since it uses less digits than its factorization.
101110100020011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 405283 (or 405280 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101110100020011 its reverse (110020001011101), we get a palindrome (211130101031112).
The spelling of 101110100020011 in words is "one hundred one trillion, one hundred ten billion, one hundred million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •