Base | Representation |
---|---|
bin | 101111000101011001… |
… | …1100100101011110101 |
3 | 100122222201222210001222 |
4 | 1132022303210223311 |
5 | 3124034413220341 |
6 | 114241203000125 |
7 | 10206450342110 |
oct | 1361263445365 |
9 | 318881883058 |
10 | 101113023221 |
11 | 39977735a01 |
12 | 1771a669045 |
13 | 96c52a0072 |
14 | 4c72bcd577 |
15 | 296bce444b |
hex | 178ace4af5 |
101113023221 has 4 divisors (see below), whose sum is σ = 115557740832. Its totient is φ = 86668305612.
The previous prime is 101113023203. The next prime is 101113023227. The reversal of 101113023221 is 122320311101.
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 not a de Polignac number, because 101113023221 - 26 = 101113023157 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 101113023221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101113023227) 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, 7222358795 + ... + 7222358808.
It is an arithmetic number, because the mean of its divisors is an integer number (28889435208).
Almost surely, 2101113023221 is an apocalyptic number.
It is an amenable number.
101113023221 is a deficient number, since it is larger than the sum of its proper divisors (14444717611).
101113023221 is an equidigital number, since it uses as much as digits as its factorization.
101113023221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14444717610.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 101113023221 its reverse (122320311101), we get a palindrome (223433334322).
The spelling of 101113023221 in words is "one hundred one billion, one hundred thirteen million, twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •