Base | Representation |
---|---|
bin | 101111000101101001… |
… | …1100001110110011101 |
3 | 100200000022202101011020 |
4 | 1132023103201312131 |
5 | 3124044034301341 |
6 | 114242102314353 |
7 | 10206611501622 |
oct | 1361323416635 |
9 | 320008671136 |
10 | 101121400221 |
11 | 39981437746 |
12 | 177214289b9 |
13 | 96c6c43c7a |
14 | 4c73d70349 |
15 | 296c8eb566 |
hex | 178b4e1d9d |
101121400221 has 8 divisors (see below), whose sum is σ = 141924772320. Its totient is φ = 63866147472.
The previous prime is 101121400217. The next prime is 101121400223. The reversal of 101121400221 is 122004121101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101121400221 - 22 = 101121400217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101121400221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101121400223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 887029770 + ... + 887029883.
It is an arithmetic number, because the mean of its divisors is an integer number (17740596540).
Almost surely, 2101121400221 is an apocalyptic number.
It is an amenable number.
101121400221 is a deficient number, since it is larger than the sum of its proper divisors (40803372099).
101121400221 is a wasteful number, since it uses less digits than its factorization.
101121400221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1774059675.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101121400221 its reverse (122004121101), we get a palindrome (223125521322).
The spelling of 101121400221 in words is "one hundred one billion, one hundred twenty-one million, four hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •