Base | Representation |
---|---|
bin | 1011111011001010101010… |
… | …0101000100000111111011 |
3 | 1201102102001020120110001202 |
4 | 2332302222211010013323 |
5 | 3204303014104432311 |
6 | 43515053534404415 |
7 | 2522150221312304 |
oct | 276625245040773 |
9 | 51372036513052 |
10 | 13111102030331 |
11 | 41a5429321578 |
12 | 157902966070b |
13 | 7414aa597176 |
14 | 33481b7157ab |
15 | 17b0b33b6e3b |
hex | becaa9441fb |
13111102030331 has 4 divisors (see below), whose sum is σ = 13111109380512. Its totient is φ = 13111094680152.
The previous prime is 13111102030319. The next prime is 13111102030333. The reversal of 13111102030331 is 13303020111131.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 13111102030331 - 234 = 13093922161147 is a prime.
It is a super-2 number, since 2×131111020303312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13111102030333) 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, 894590 + ... + 5198316.
It is an arithmetic number, because the mean of its divisors is an integer number (3277777345128).
Almost surely, 213111102030331 is an apocalyptic number.
13111102030331 is a deficient number, since it is larger than the sum of its proper divisors (7350181).
13111102030331 is an equidigital number, since it uses as much as digits as its factorization.
13111102030331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7350180.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 13111102030331 its reverse (13303020111131), we get a palindrome (26414122141462).
The spelling of 13111102030331 in words is "thirteen trillion, one hundred eleven billion, one hundred two million, thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •