Base | Representation |
---|---|
bin | 101111000010101010… |
… | …0100111010000100101 |
3 | 100122202022212121001111 |
4 | 1132011110213100211 |
5 | 3123342340134341 |
6 | 114224115025021 |
7 | 10204252340521 |
oct | 1360524472045 |
9 | 318668777044 |
10 | 101021021221 |
11 | 3992a80749a |
12 | 176b389b171 |
13 | 96ac1c9b03 |
14 | 4c648c0d81 |
15 | 2963bbe681 |
hex | 1785527425 |
101021021221 has 8 divisors (see below), whose sum is σ = 107001108864. Its totient is φ = 95045119680.
The previous prime is 101021021203. The next prime is 101021021237. The reversal of 101021021221 is 122120120101.
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 101021021221 - 211 = 101021019173 is a prime.
It is a super-3 number, since 3×1010210212213 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101021021281) 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, 996765 + ... + 1093426.
It is an arithmetic number, because the mean of its divisors is an integer number (13375138608).
Almost surely, 2101021021221 is an apocalyptic number.
It is an amenable number.
101021021221 is a deficient number, since it is larger than the sum of its proper divisors (5980087643).
101021021221 is a wasteful number, since it uses less digits than its factorization.
101021021221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2093051.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101021021221 its reverse (122120120101), we get a palindrome (223141141322).
The spelling of 101021021221 in words is "one hundred one billion, twenty-one million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •