Base | Representation |
---|---|
bin | 101111000010101100… |
… | …0011000101101101101 |
3 | 100122202101201211201010 |
4 | 1132011120120231231 |
5 | 3123343113311341 |
6 | 114224152135433 |
7 | 10204263630066 |
oct | 1360530305555 |
9 | 318671654633 |
10 | 101022010221 |
11 | 39930322550 |
12 | 176b4097579 |
13 | 96ac485012 |
14 | 4c64a9b56d |
15 | 2963d17716 |
hex | 1785618b6d |
101022010221 has 32 divisors (see below), whose sum is σ = 147330763776. Its totient is φ = 61063344000.
The previous prime is 101022010097. The next prime is 101022010241. The reversal of 101022010221 is 122010220101.
It is not a de Polignac number, because 101022010221 - 27 = 101022010093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101022010197 and 101022010206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101022010241) 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, 23507745 + ... + 23512041.
It is an arithmetic number, because the mean of its divisors is an integer number (4604086368).
Almost surely, 2101022010221 is an apocalyptic number.
101022010221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101022010221 is a deficient number, since it is larger than the sum of its proper divisors (46308753555).
101022010221 is a wasteful number, since it uses less digits than its factorization.
101022010221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6033.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101022010221 its reverse (122010220101), we get a palindrome (223032230322).
The spelling of 101022010221 in words is "one hundred one billion, twenty-two million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •