Base | Representation |
---|---|
bin | 101111000101000111… |
… | …0001011110111001101 |
3 | 100122222001112211121222 |
4 | 1132022032023313031 |
5 | 3124024411102341 |
6 | 114240212533125 |
7 | 10206301131551 |
oct | 1361216136715 |
9 | 318861484558 |
10 | 101103222221 |
11 | 39972151301 |
12 | 177173211a5 |
13 | 96c324ac61 |
14 | 4c7179b861 |
15 | 296b00a44b |
hex | 178a38bdcd |
101103222221 has 4 divisors (see below), whose sum is σ = 101723487552. Its totient is φ = 100482956892.
The previous prime is 101103222193. The next prime is 101103222247. The reversal of 101103222221 is 122222301101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101103222221 - 234 = 83923353037 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101103222221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101103222271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 310132421 + ... + 310132746.
It is an arithmetic number, because the mean of its divisors is an integer number (25430871888).
Almost surely, 2101103222221 is an apocalyptic number.
It is an amenable number.
101103222221 is a deficient number, since it is larger than the sum of its proper divisors (620265331).
101103222221 is an equidigital number, since it uses as much as digits as its factorization.
101103222221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 620265330.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 101103222221 its reverse (122222301101), we get a palindrome (223325523322).
The spelling of 101103222221 in words is "one hundred one billion, one hundred three million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •