Base | Representation |
---|---|
bin | 1011111011001011011001… |
… | …1100011101010111101001 |
3 | 1201102102120010011021201201 |
4 | 2332302312130131113221 |
5 | 3204303421040213113 |
6 | 43515125405244201 |
7 | 2522155156346332 |
oct | 276626634352751 |
9 | 51372503137651 |
10 | 13111301101033 |
11 | 41a552072a313 |
12 | 1579084263661 |
13 | 74150c8b7495 |
14 | 334839d35289 |
15 | 17b0c5adacdd |
hex | becb671d5e9 |
13111301101033 has 8 divisors (see below), whose sum is σ = 13143916725056. Its totient is φ = 13078714280400.
The previous prime is 13111301101027. The next prime is 13111301101037. The reversal of 13111301101033 is 33010110311131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13111301101033 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13111301101033.
It is not an unprimeable number, because it can be changed into a prime (13111301101037) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6289173 + ... + 8110258.
It is an arithmetic number, because the mean of its divisors is an integer number (1642989590632).
Almost surely, 213111301101033 is an apocalyptic number.
It is an amenable number.
13111301101033 is a deficient number, since it is larger than the sum of its proper divisors (32615624023).
13111301101033 is a wasteful number, since it uses less digits than its factorization.
13111301101033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14401695.
The product of its (nonzero) digits is 81, while the sum is 19.
Adding to 13111301101033 its reverse (33010110311131), we get a palindrome (46121411412164).
The spelling of 13111301101033 in words is "thirteen trillion, one hundred eleven billion, three hundred one million, one hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •