Base | Representation |
---|---|
bin | 101111000110000000… |
… | …0111011110101011011 |
3 | 100200001011011002212202 |
4 | 1132030000323311123 |
5 | 3124110111200011 |
6 | 114243205400415 |
7 | 10210114615160 |
oct | 1361400736533 |
9 | 320034132782 |
10 | 101133303131 |
11 | 39988127563 |
12 | 1772540910b |
13 | 96c9550a03 |
14 | 4c7578c067 |
15 | 296d99d23b |
hex | 178c03bd5b |
101133303131 has 4 divisors (see below), whose sum is σ = 115580917872. Its totient is φ = 86685688392.
The previous prime is 101133303119. The next prime is 101133303157. The reversal of 101133303131 is 131303331101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131303331101 = 4133 ⋅31769497.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101133303131 is a prime.
It is a super-3 number, since 3×1011333031313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (101133303031) 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, 7223807360 + ... + 7223807373.
It is an arithmetic number, because the mean of its divisors is an integer number (28895229468).
Almost surely, 2101133303131 is an apocalyptic number.
101133303131 is a deficient number, since it is larger than the sum of its proper divisors (14447614741).
101133303131 is an equidigital number, since it uses as much as digits as its factorization.
101133303131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14447614740.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 101133303131 its reverse (131303331101), we get a palindrome (232436634232).
The spelling of 101133303131 in words is "one hundred one billion, one hundred thirty-three million, three hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •