Base | Representation |
---|---|
bin | 101111000010000010… |
… | …1010000110111011001 |
3 | 100122200212201210022101 |
4 | 1132010011100313121 |
5 | 3123322024020441 |
6 | 114222053123401 |
7 | 10203610464103 |
oct | 1360405206731 |
9 | 318625653271 |
10 | 101000220121 |
11 | 39919a9a2a9 |
12 | 176a8929561 |
13 | 96a7ac5b78 |
14 | 4c61c28573 |
15 | 2961e61231 |
hex | 1784150dd9 |
101000220121 has 8 divisors (see below), whose sum is σ = 107661795200. Its totient is φ = 94473222480.
The previous prime is 101000220103. The next prime is 101000220163. The reversal of 101000220121 is 121022000101.
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 101000220121 - 27 = 101000219993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101000220098 and 101000220107.
It is not an unprimeable number, because it can be changed into a prime (101000220221) 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, 33642810 + ... + 33645811.
It is an arithmetic number, because the mean of its divisors is an integer number (13457724400).
Almost surely, 2101000220121 is an apocalyptic number.
It is an amenable number.
101000220121 is a deficient number, since it is larger than the sum of its proper divisors (6661575079).
101000220121 is an equidigital number, since it uses as much as digits as its factorization.
101000220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67288719.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 101000220121 its reverse (121022000101), we get a palindrome (222022220222).
The spelling of 101000220121 in words is "one hundred one billion, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •