Base | Representation |
---|---|
bin | 1011111011001010101100… |
… | …0100010001111010110101 |
3 | 1201102102001210222011222201 |
4 | 2332302223010101322311 |
5 | 3204303023203311201 |
6 | 43515054430024501 |
7 | 2522150351003332 |
oct | 276625304217265 |
9 | 51372053864881 |
10 | 13111110213301 |
11 | 41a5432a00561 |
12 | 1579030348131 |
13 | 7414ac1a0969 |
14 | 33481c845989 |
15 | 17b0b3e81801 |
hex | becab111eb5 |
13111110213301 has 32 divisors (see below), whose sum is σ = 14855061484800. Its totient is φ = 11497559592960.
The previous prime is 13111110213287. The next prime is 13111110213307. The reversal of 13111110213301 is 10331201111131.
It is not a de Polignac number, because 13111110213301 - 215 = 13111110180533 is a prime.
It is a super-2 number, since 2×131111102133012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111110213307) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8680681 + ... + 10078513.
It is an arithmetic number, because the mean of its divisors is an integer number (464220671400).
Almost surely, 213111110213301 is an apocalyptic number.
It is an amenable number.
13111110213301 is a deficient number, since it is larger than the sum of its proper divisors (1743951271499).
13111110213301 is a wasteful number, since it uses less digits than its factorization.
13111110213301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1398349.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 13111110213301 its reverse (10331201111131), we get a palindrome (23442311324432).
The spelling of 13111110213301 in words is "thirteen trillion, one hundred eleven billion, one hundred ten million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •