Base | Representation |
---|---|
bin | 110100101010101011… |
… | …0111000010110001101 |
3 | 101210221012212211010112 |
4 | 1221111112320112031 |
5 | 3323112402223041 |
6 | 123542531245405 |
7 | 11112516301001 |
oct | 1512526702615 |
9 | 353835784115 |
10 | 113101211021 |
11 | 43a69759927 |
12 | 19b05449865 |
13 | a885b5a206 |
14 | 568d014701 |
15 | 2e1e4cedeb |
hex | 1a555b858d |
113101211021 has 8 divisors (see below), whose sum is σ = 121270101120. Its totient is φ = 105100751808.
The previous prime is 113101210949. The next prime is 113101211033. The reversal of 113101211021 is 120112101311.
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 113101211021 - 222 = 113097016717 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113101210987 and 113101211005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113101211051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42106331 + ... + 42109016.
It is an arithmetic number, because the mean of its divisors is an integer number (15158762640).
Almost surely, 2113101211021 is an apocalyptic number.
It is an amenable number.
113101211021 is a deficient number, since it is larger than the sum of its proper divisors (8168890099).
113101211021 is an equidigital number, since it uses as much as digits as its factorization.
113101211021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84215443.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 113101211021 its reverse (120112101311), we get a palindrome (233213312332).
The spelling of 113101211021 in words is "one hundred thirteen billion, one hundred one million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •