Base | Representation |
---|---|
bin | 10110111111001101110000… |
… | …011010001101110100101110 |
3 | 111020222011122221221010121111 |
4 | 112333031300122031310232 |
5 | 101222420044000213402 |
6 | 555005114105222234 |
7 | 30203213013106153 |
oct | 2677156032156456 |
9 | 436864587833544 |
10 | 101101121101102 |
11 | 2a239821185001 |
12 | b40a0a8a9197a |
13 | 4454a4427c545 |
14 | 1ad746b14c22a |
15 | ba4d138c39d7 |
hex | 5bf37068dd2e |
101101121101102 has 8 divisors (see below), whose sum is σ = 151652604493800. Its totient is φ = 50550252936504.
The previous prime is 101101121101093. The next prime is 101101121101103. The reversal of 101101121101102 is 201101121101101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1011011211011022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101121101103) 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, 153395977 + ... + 154053652.
It is an arithmetic number, because the mean of its divisors is an integer number (18956575561725).
Almost surely, 2101101121101102 is an apocalyptic number.
101101121101102 is a deficient number, since it is larger than the sum of its proper divisors (50551483392698).
101101121101102 is a wasteful number, since it uses less digits than its factorization.
101101121101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307614050.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 101101121101102 its reverse (201101121101101), we get a palindrome (302202242202203).
Subtracting 101101121101102 from its reverse (201101121101101), we obtain a palindrome (99999999999999).
The spelling of 101101121101102 in words is "one hundred one trillion, one hundred one billion, one hundred twenty-one million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •