Base | Representation |
---|---|
bin | 101111001000100111… |
… | …1111001000111001101 |
3 | 100200021021101011120012 |
4 | 1132101033321013031 |
5 | 3124300101011341 |
6 | 114300023403005 |
7 | 10212232145420 |
oct | 1362117710715 |
9 | 320237334505 |
10 | 101221110221 |
11 | 39a22750300 |
12 | 1774a8b3465 |
13 | 97117b577a |
14 | 4c832c79b7 |
15 | 29765450eb |
hex | 17913f91cd |
101221110221 has 24 divisors (see below), whose sum is σ = 129859242240. Its totient is φ = 77195400480.
The previous prime is 101221110217. The next prime is 101221110227. The reversal of 101221110221 is 122011122101.
It is not a de Polignac number, because 101221110221 - 22 = 101221110217 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101221110196 and 101221110205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101221110227) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1231526 + ... + 1311143.
It is an arithmetic number, because the mean of its divisors is an integer number (5410801760).
Almost surely, 2101221110221 is an apocalyptic number.
101221110221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101221110221 is a deficient number, since it is larger than the sum of its proper divisors (28638132019).
101221110221 is a wasteful number, since it uses less digits than its factorization.
101221110221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2542745 (or 2542734 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101221110221 its reverse (122011122101), we get a palindrome (223232232322).
The spelling of 101221110221 in words is "one hundred one billion, two hundred twenty-one million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.875 sec. • engine limits •