Base | Representation |
---|---|
bin | 101111001000010010… |
… | …1111011100100001101 |
3 | 100200020111200022101210 |
4 | 1132100211323210031 |
5 | 3124234242011341 |
6 | 114254551525033 |
7 | 10212036512433 |
oct | 1362045734415 |
9 | 320214608353 |
10 | 101210110221 |
11 | 39a175178a0 |
12 | 17747089779 |
13 | 970c4339ac |
14 | 4c81a62d53 |
15 | 29755c0c16 |
hex | 179097b90d |
101210110221 has 16 divisors (see below), whose sum is σ = 147228433920. Its totient is φ = 61333740720.
The previous prime is 101210110219. The next prime is 101210110231. The reversal of 101210110221 is 122011012101.
It is not a de Polignac number, because 101210110221 - 21 = 101210110219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101210110197 and 101210110206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101210110201) 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 15 ways as a sum of consecutive naturals, for example, 230826 + ... + 505668.
It is an arithmetic number, because the mean of its divisors is an integer number (9201777120).
Almost surely, 2101210110221 is an apocalyptic number.
101210110221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101210110221 is a deficient number, since it is larger than the sum of its proper divisors (46018323699).
101210110221 is a wasteful number, since it uses less digits than its factorization.
101210110221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286016.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101210110221 its reverse (122011012101), we get a palindrome (223221122322).
The spelling of 101210110221 in words is "one hundred one billion, two hundred ten million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •