Base | Representation |
---|---|
bin | 101111001000000001… |
… | …1101000101101110001 |
3 | 100200012212202120021211 |
4 | 1132100003220231301 |
5 | 3124224441320423 |
6 | 114254031120121 |
7 | 10211600220262 |
oct | 1362003505561 |
9 | 320185676254 |
10 | 101201120113 |
11 | 39a12437455 |
12 | 17744073041 |
13 | 970a6069c2 |
14 | 4c807a2969 |
15 | 29748e710d |
hex | 17900e8b71 |
101201120113 has 8 divisors (see below), whose sum is σ = 104712955200. Its totient is φ = 97690761168.
The previous prime is 101201120107. The next prime is 101201120147. The reversal of 101201120113 is 311021102101.
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 not a de Polignac number, because 101201120113 - 29 = 101201119601 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101201120093 and 101201120102.
It is not an unprimeable number, because it can be changed into a prime (101201120213) 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, 228631 + ... + 504652.
It is an arithmetic number, because the mean of its divisors is an integer number (13089119400).
Almost surely, 2101201120113 is an apocalyptic number.
It is an amenable number.
101201120113 is a deficient number, since it is larger than the sum of its proper divisors (3511835087).
101201120113 is an equidigital number, since it uses as much as digits as its factorization.
101201120113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 738071.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101201120113 its reverse (311021102101), we get a palindrome (412222222214).
The spelling of 101201120113 in words is "one hundred one billion, two hundred one million, one hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •