Base | Representation |
---|---|
bin | 1011111011001011001100… |
… | …0010110000000000110001 |
3 | 1201102102102010202202222210 |
4 | 2332302303002300000301 |
5 | 3204303311432430001 |
6 | 43515120010122333 |
7 | 2522153564301435 |
oct | 276626302600061 |
9 | 51372363682883 |
10 | 13111244030001 |
11 | 41a54a1499a77 |
12 | 15790691203a9 |
13 | 741500b24740 |
14 | 33483251a9c5 |
15 | 17b0c0ab5dd6 |
hex | becb30b0031 |
13111244030001 has 16 divisors (see below), whose sum is σ = 19107392757824. Its totient is φ = 7948033118784.
The previous prime is 13111244029979. The next prime is 13111244030029. The reversal of 13111244030001 is 10003044211131.
It is not a de Polignac number, because 13111244030001 - 229 = 13110707159089 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 13111244030001.
It is not an unprimeable number, because it can be changed into a prime (13111244030051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2508846226 + ... + 2508851451.
It is an arithmetic number, because the mean of its divisors is an integer number (1194212047364).
Almost surely, 213111244030001 is an apocalyptic number.
It is an amenable number.
13111244030001 is a deficient number, since it is larger than the sum of its proper divisors (5996148727823).
13111244030001 is a wasteful number, since it uses less digits than its factorization.
13111244030001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5017697760.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 13111244030001 its reverse (10003044211131), we get a palindrome (23114288241132).
The spelling of 13111244030001 in words is "thirteen trillion, one hundred eleven billion, two hundred forty-four million, thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •