Base | Representation |
---|---|
bin | 101111001000101000… |
… | …0010001011111110101 |
3 | 100200021021120020120110 |
4 | 1132101100101133311 |
5 | 3124300112210401 |
6 | 114300025453233 |
7 | 10212233042544 |
oct | 1362120213765 |
9 | 320237506513 |
10 | 101221210101 |
11 | 39a22809350 |
12 | 1774a941219 |
13 | 971181c07b |
14 | 4c8331215b |
15 | 29765649d6 |
hex | 17914117f5 |
101221210101 has 8 divisors (see below), whose sum is σ = 147230851104. Its totient is φ = 61346187920.
The previous prime is 101221210007. The next prime is 101221210213. The reversal of 101221210101 is 101012122101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101221210101 - 29 = 101221209589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101221210901) 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, 1533654666 + ... + 1533654731.
It is an arithmetic number, because the mean of its divisors is an integer number (18403856388).
Almost surely, 2101221210101 is an apocalyptic number.
101221210101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101221210101 is a deficient number, since it is larger than the sum of its proper divisors (46009641003).
101221210101 is a wasteful number, since it uses less digits than its factorization.
101221210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3067309411.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101221210101 its reverse (101012122101), we get a palindrome (202233332202).
The spelling of 101221210101 in words is "one hundred one billion, two hundred twenty-one million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •