Base | Representation |
---|---|
bin | 101111001000100111… |
… | …1100011011000100101 |
3 | 100200021021012122110220 |
4 | 1132101033203120211 |
5 | 3124300040134341 |
6 | 114300021434553 |
7 | 10212231325065 |
oct | 1362117433045 |
9 | 320237178426 |
10 | 101221021221 |
11 | 39a2269a451 |
12 | 1774a86ba59 |
13 | 97117840c8 |
14 | 4c832a33a5 |
15 | 2976528a66 |
hex | 17913e3625 |
101221021221 has 8 divisors (see below), whose sum is σ = 135017769600. Its totient is φ = 67452476832.
The previous prime is 101221021219. The next prime is 101221021261. The reversal of 101221021221 is 122120122101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101221021221 - 21 = 101221021219 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101221021221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101221021201) 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 7 ways as a sum of consecutive naturals, for example, 7042621 + ... + 7056978.
It is an arithmetic number, because the mean of its divisors is an integer number (16877221200).
Almost surely, 2101221021221 is an apocalyptic number.
It is an amenable number.
101221021221 is a deficient number, since it is larger than the sum of its proper divisors (33796748379).
101221021221 is a wasteful number, since it uses less digits than its factorization.
101221021221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14101995.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101221021221 its reverse (122120122101), we get a palindrome (223341143322).
The spelling of 101221021221 in words is "one hundred one billion, two hundred twenty-one million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •