Base | Representation |
---|---|
bin | 101111001000010110… |
… | …1111110101100111101 |
3 | 100200020122122111202221 |
4 | 1132100231332230331 |
5 | 3124240312021341 |
6 | 114255105045341 |
7 | 10212063451150 |
oct | 1362055765475 |
9 | 320218574687 |
10 | 101212220221 |
11 | 39a187290a2 |
12 | 17747926851 |
13 | 970c9c2208 |
14 | 4c82051c97 |
15 | 297588aed1 |
hex | 1790b7eb3d |
101212220221 has 32 divisors (see below), whose sum is σ = 129279525120. Its totient is φ = 77352192000.
The previous prime is 101212220201. The next prime is 101212220243. The reversal of 101212220221 is 122022212101.
It is a happy number.
It is not a de Polignac number, because 101212220221 - 213 = 101212212029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101212220195 and 101212220204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101212220201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 754221 + ... + 878221.
It is an arithmetic number, because the mean of its divisors is an integer number (4039985160).
Almost surely, 2101212220221 is an apocalyptic number.
It is an amenable number.
101212220221 is a deficient number, since it is larger than the sum of its proper divisors (28067304899).
101212220221 is an equidigital number, since it uses as much as digits as its factorization.
101212220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124082 (or 124044 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 101212220221 its reverse (122022212101), we get a palindrome (223234432322).
The spelling of 101212220221 in words is "one hundred one billion, two hundred twelve million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •