Base | Representation |
---|---|
bin | 10111000000111101100000… |
… | …111101111000110100110111 |
3 | 111021101122101222002202010021 |
4 | 113000331200331320310313 |
5 | 101231401324000213421 |
6 | 555140201401510011 |
7 | 30214661512221454 |
oct | 2700754075706467 |
9 | 437348358082107 |
10 | 101221121101111 |
11 | 2a28570003a130 |
12 | b4293b87a2307 |
13 | 44631594668cb |
14 | 1add1b249482b |
15 | ba7ed8879341 |
hex | 5c0f60f78d37 |
101221121101111 has 16 divisors (see below), whose sum is σ = 116921485624608. Its totient is φ = 86604105779200.
The previous prime is 101221121101091. The next prime is 101221121101147. The reversal of 101221121101111 is 111101121122101.
It is a cyclic number.
It is not a de Polignac number, because 101221121101111 - 215 = 101221121068343 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101221121141111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 520671 + ... + 14237743.
It is an arithmetic number, because the mean of its divisors is an integer number (7307592851538).
Almost surely, 2101221121101111 is an apocalyptic number.
101221121101111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101221121101111 is a deficient number, since it is larger than the sum of its proper divisors (15700364523497).
101221121101111 is a wasteful number, since it uses less digits than its factorization.
101221121101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13756562.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 101221121101111 its reverse (111101121122101), we get a palindrome (212322242223212).
The spelling of 101221121101111 in words is "one hundred one trillion, two hundred twenty-one billion, one hundred twenty-one million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •