Base | Representation |
---|---|
bin | 101111000010011011… |
… | …0110110111011111001 |
3 | 100122201210012022022121 |
4 | 1132010312312323321 |
5 | 3123333341033423 |
6 | 114223235521241 |
7 | 10204126132630 |
oct | 1360466667371 |
9 | 318653168277 |
10 | 101013221113 |
11 | 3992636a122 |
12 | 176b1159221 |
13 | 96aa6c866c |
14 | 4c63850517 |
15 | 296317d45d |
hex | 1784db6ef9 |
101013221113 has 8 divisors (see below), whose sum is σ = 115461518400. Its totient is φ = 86569383120.
The previous prime is 101013221083. The next prime is 101013221131. The reversal of 101013221113 is 311122310101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101013221113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101013225113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1066138 + ... + 1157011.
It is an arithmetic number, because the mean of its divisors is an integer number (14432689800).
Almost surely, 2101013221113 is an apocalyptic number.
It is an amenable number.
101013221113 is a deficient number, since it is larger than the sum of its proper divisors (14448297287).
101013221113 is an equidigital number, since it uses as much as digits as its factorization.
101013221113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2229647.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 101013221113 its reverse (311122310101), we get a palindrome (412135531214).
The spelling of 101013221113 in words is "one hundred one billion, thirteen million, two hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •