Base | Representation |
---|---|
bin | 101111000010101000… |
… | …1001001000101110101 |
3 | 100122202021011100202210 |
4 | 1132011101021011311 |
5 | 3123342122024341 |
6 | 114224043324033 |
7 | 10204241530461 |
oct | 1360521110565 |
9 | 318667140683 |
10 | 101020111221 |
11 | 3992a245827 |
12 | 176b3520619 |
13 | 96abc6b853 |
14 | 4c647254a1 |
15 | 2963a8ec16 |
hex | 1785449175 |
101020111221 has 16 divisors (see below), whose sum is σ = 143186408640. Its totient is φ = 63170467200.
The previous prime is 101020111207. The next prime is 101020111261. The reversal of 101020111221 is 122111020101.
It is not a de Polignac number, because 101020111221 - 25 = 101020111189 is a prime.
It is a super-2 number, since 2×1010201112212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101020111197 and 101020111206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101020111261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8767920 + ... + 8779433.
It is an arithmetic number, because the mean of its divisors is an integer number (8949150540).
Almost surely, 2101020111221 is an apocalyptic number.
It is an amenable number.
101020111221 is a deficient number, since it is larger than the sum of its proper divisors (42166297419).
101020111221 is a wasteful number, since it uses less digits than its factorization.
101020111221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17547476.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101020111221 its reverse (122111020101), we get a palindrome (223131131322).
The spelling of 101020111221 in words is "one hundred one billion, twenty million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •