Base | Representation |
---|---|
bin | 101111001000100110… |
… | …0011011001100000101 |
3 | 100200021012122222122112 |
4 | 1132101030123030011 |
5 | 3124244332414341 |
6 | 114255552110405 |
7 | 10212221341316 |
oct | 1362114331405 |
9 | 320235588575 |
10 | 101220201221 |
11 | 39a2218a367 |
12 | 1774a535405 |
13 | 9711557ab9 |
14 | 4c8312c60d |
15 | 2976415aeb |
hex | 179131b305 |
101220201221 has 8 divisors (see below), whose sum is σ = 103159897344. Its totient is φ = 99289548720.
The previous prime is 101220201179. The next prime is 101220201233. The reversal of 101220201221 is 122102022101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-101220201221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101220201196 and 101220201205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101220201821) 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 7 ways as a sum of consecutive naturals, for example, 2238305 + ... + 2283078.
It is an arithmetic number, because the mean of its divisors is an integer number (12894987168).
Almost surely, 2101220201221 is an apocalyptic number.
It is an amenable number.
101220201221 is a deficient number, since it is larger than the sum of its proper divisors (1939696123).
101220201221 is an equidigital number, since it uses as much as digits as its factorization.
101220201221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4521811.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 101220201221 its reverse (122102022101), we get a palindrome (223322223322).
The spelling of 101220201221 in words is "one hundred one billion, two hundred twenty million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •