Base | Representation |
---|---|
bin | 101111001011010011… |
… | …1001110101101110101 |
3 | 100200111112201211200020 |
4 | 1132112213032231311 |
5 | 3124441121122401 |
6 | 114313000435353 |
7 | 10214404155411 |
oct | 1362647165565 |
9 | 320445654606 |
10 | 101311114101 |
11 | 39a6953457a |
12 | 17774a78b59 |
13 | 97273393c2 |
14 | 4c91235d41 |
15 | 297e3c2d36 |
hex | 17969ceb75 |
101311114101 has 8 divisors (see below), whose sum is σ = 135098192544. Its totient is φ = 67532389200.
The previous prime is 101311114067. The next prime is 101311114123. The reversal of 101311114101 is 101411113101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101311114101 - 223 = 101302725493 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101311114901) 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, 2060031 + ... + 2108636.
It is an arithmetic number, because the mean of its divisors is an integer number (16887274068).
Almost surely, 2101311114101 is an apocalyptic number.
It is an amenable number.
101311114101 is a deficient number, since it is larger than the sum of its proper divisors (33787078443).
101311114101 is an equidigital number, since it uses as much as digits as its factorization.
101311114101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4176771.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 101311114101 its reverse (101411113101), we get a palindrome (202722227202).
The spelling of 101311114101 in words is "one hundred one billion, three hundred eleven million, one hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •