Base | Representation |
---|---|
bin | 101111001000100111… |
… | …1111100000000110101 |
3 | 100200021021101202212012 |
4 | 1132101033330000311 |
5 | 3124300101401401 |
6 | 114300023534005 |
7 | 10212232225151 |
oct | 1362117740065 |
9 | 320237352765 |
10 | 101221122101 |
11 | 39a22759220 |
12 | 1774a8ba305 |
13 | 97117bacb8 |
14 | 4c832cc061 |
15 | 29765488bb |
hex | 17913fc035 |
101221122101 has 32 divisors (see below), whose sum is σ = 125158348800. Its totient is φ = 80657268480.
The previous prime is 101221122089. The next prime is 101221122127.
101221122101 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 101221122101 - 214 = 101221105717 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 (101221122701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31805 + ... + 451058.
It is an arithmetic number, because the mean of its divisors is an integer number (3911198400).
Almost surely, 2101221122101 is an apocalyptic number.
101221122101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101221122101 is a deficient number, since it is larger than the sum of its proper divisors (23937226699).
101221122101 is a wasteful number, since it uses less digits than its factorization.
101221122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482969.
The product of its (nonzero) digits is 16, while the sum is 14.
It can be divided in two parts, 101221 and 122101, that added together give a palindrome (223322).
The spelling of 101221122101 in words is "one hundred one billion, two hundred twenty-one million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •