Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …101111101111011110100011 |
3 | 111020222002002012101120100102 |
4 | 112333030310233233132203 |
5 | 101222411021222023021 |
6 | 555004430510413015 |
7 | 30203146136612540 |
oct | 2677146457573643 |
9 | 436862065346312 |
10 | 101100120111011 |
11 | 2a23935814536a |
12 | b409a6980116b |
13 | 4454914a86808 |
14 | 1ad73b4223bc7 |
15 | ba4ca5a9900b |
hex | 5bf334bef7a3 |
101100120111011 has 16 divisors (see below), whose sum is σ = 125184749082624. Its totient is φ = 79663022135424.
The previous prime is 101100120110989. The next prime is 101100120111017. The reversal of 101100120111011 is 110111021001101.
It is a happy number.
It is not a de Polignac number, because 101100120111011 - 210 = 101100120109987 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101100120110983 and 101100120111001.
It is not an unprimeable number, because it can be changed into a prime (101100120111017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9878841875 + ... + 9878852108.
It is an arithmetic number, because the mean of its divisors is an integer number (7824046817664).
Almost surely, 2101100120111011 is an apocalyptic number.
101100120111011 is a deficient number, since it is larger than the sum of its proper divisors (24084628971613).
101100120111011 is a wasteful number, since it uses less digits than its factorization.
101100120111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19757694050.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 101100120111011 its reverse (110111021001101), we get a palindrome (211211141112112).
The spelling of 101100120111011 in words is "one hundred one trillion, one hundred billion, one hundred twenty million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •