Base | Representation |
---|---|
bin | 10110111111010110000111… |
… | …101110000101111000011011 |
3 | 111021000000211212022021012112 |
4 | 112333112013232011320123 |
5 | 101223041442120401021 |
6 | 555013201211502535 |
7 | 30203651405402453 |
oct | 2677260756057033 |
9 | 437000755267175 |
10 | 101110102122011 |
11 | 2a24260a792a34 |
12 | b40b994757a4b |
13 | 4455845b15cb8 |
14 | 1ad7a7dc22d63 |
15 | ba518c0a1d5b |
hex | 5bf587b85e1b |
101110102122011 has 4 divisors (see below), whose sum is σ = 103017839897952. Its totient is φ = 99202364346072.
The previous prime is 101110102121999. The next prime is 101110102122031. The reversal of 101110102122011 is 110221201011101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101110102122011 - 218 = 101110101859867 is a prime.
It is a super-2 number, since 2×1011101021220112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101110102122031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 953868887891 + ... + 953868887996.
It is an arithmetic number, because the mean of its divisors is an integer number (25754459974488).
Almost surely, 2101110102122011 is an apocalyptic number.
101110102122011 is a deficient number, since it is larger than the sum of its proper divisors (1907737775941).
101110102122011 is an equidigital number, since it uses as much as digits as its factorization.
101110102122011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1907737775940.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101110102122011 its reverse (110221201011101), we get a palindrome (211331303133112).
The spelling of 101110102122011 in words is "one hundred one trillion, one hundred ten billion, one hundred two million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •