Base | Representation |
---|---|
bin | 101111001011111001… |
… | …1011110010110111001 |
3 | 100200112221100021200221 |
4 | 1132113303132112321 |
5 | 3130011230213423 |
6 | 114314553100041 |
7 | 10215036101524 |
oct | 1362763362671 |
9 | 320487307627 |
10 | 101331101113 |
11 | 39a79846070 |
12 | 1777b6b7621 |
13 | 972b516938 |
14 | 4c93b59bbb |
15 | 298101ee5d |
hex | 1797cde5b9 |
101331101113 has 4 divisors (see below), whose sum is σ = 110543019408. Its totient is φ = 92119182820.
The previous prime is 101331101101. The next prime is 101331101141. The reversal of 101331101113 is 311101133101.
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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101331101113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101331101413) 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, 4605959131 + ... + 4605959152.
It is an arithmetic number, because the mean of its divisors is an integer number (27635754852).
Almost surely, 2101331101113 is an apocalyptic number.
It is an amenable number.
101331101113 is a deficient number, since it is larger than the sum of its proper divisors (9211918295).
101331101113 is an equidigital number, since it uses as much as digits as its factorization.
101331101113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9211918294.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 101331101113 its reverse (311101133101), we get a palindrome (412432234214).
The spelling of 101331101113 in words is "one hundred one billion, three hundred thirty-one million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •