Base | Representation |
---|---|
bin | 10110111111001101110000… |
… | …011010001111111111111011 |
3 | 111020222011122221221120211110 |
4 | 112333031300122033333323 |
5 | 101222420044001010021 |
6 | 555005114105331403 |
7 | 30203213013144141 |
oct | 2677156032177773 |
9 | 436864587846743 |
10 | 101101121110011 |
11 | 2a239821190770 |
12 | b40a0a8a96b63 |
13 | 4454a44283609 |
14 | 1ad746b151591 |
15 | ba4d138c6476 |
hex | 5bf37068fffb |
101101121110011 has 128 divisors (see below), whose sum is σ = 161039646720000. Its totient is φ = 55748196241920.
The previous prime is 101101121110007. The next prime is 101101121110063. The reversal of 101101121110011 is 110011121101101.
It is not a de Polignac number, because 101101121110011 - 22 = 101101121110007 is a prime.
It is a super-2 number, since 2×1011011211100112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101101121110091) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 8776895110 + ... + 8776906628.
It is an arithmetic number, because the mean of its divisors is an integer number (1258122240000).
Almost surely, 2101101121110011 is an apocalyptic number.
101101121110011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101101121110011 is a deficient number, since it is larger than the sum of its proper divisors (59938525609989).
101101121110011 is a wasteful number, since it uses less digits than its factorization.
101101121110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16457.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 101101121110011 its reverse (110011121101101), we get a palindrome (211112242211112).
The spelling of 101101121110011 in words is "one hundred one trillion, one hundred one billion, one hundred twenty-one million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •