Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …110010011110111011011111 |
3 | 111020222011101012220201212210 |
4 | 112333031221302132323133 |
5 | 101222414332031201421 |
6 | 555005055100331503 |
7 | 30203210164001541 |
oct | 2677155162367337 |
9 | 436864335821783 |
10 | 101101010022111 |
11 | 2a239774506790 |
12 | b40a077843b93 |
13 | 4454a2725a028 |
14 | 1ad745a4b5691 |
15 | ba4d08c81576 |
hex | 5bf369c9eedf |
101101010022111 has 8 divisors (see below), whose sum is σ = 147056014577664. Its totient is φ = 61273339407320.
The previous prime is 101101010022097. The next prime is 101101010022151. The reversal of 101101010022111 is 111220010101101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101101010022111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101010022151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1531833485151 + ... + 1531833485216.
It is an arithmetic number, because the mean of its divisors is an integer number (18382001822208).
Almost surely, 2101101010022111 is an apocalyptic number.
101101010022111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101101010022111 is a deficient number, since it is larger than the sum of its proper divisors (45955004555553).
101101010022111 is a wasteful number, since it uses less digits than its factorization.
101101010022111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3063666970381.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 101101010022111 its reverse (111220010101101), we get a palindrome (212321020123212).
The spelling of 101101010022111 in words is "one hundred one trillion, one hundred one billion, ten million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.805 sec. • engine limits •