Base | Representation |
---|---|
bin | 1011111011001010101100… |
… | …0011100000110001100001 |
3 | 1201102102001210120221212011 |
4 | 2332302223003200301201 |
5 | 3204303023130341001 |
6 | 43515054421432521 |
7 | 2522150346204421 |
oct | 276625303406141 |
9 | 51372053527764 |
10 | 13111110012001 |
11 | 41a54328832a1 |
12 | 157903026b741 |
13 | 7414ac130151 |
14 | 33481c7d2481 |
15 | 17b0b3e41d51 |
hex | becab0e0c61 |
13111110012001 has 4 divisors (see below), whose sum is σ = 13112052389892. Its totient is φ = 13110167634112.
The previous prime is 13111110011927. The next prime is 13111110012059. The reversal of 13111110012001 is 10021001111131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11091297729600 + 2019812282401 = 3330360^2 + 1421201^2 .
It is a cyclic number.
It is not a de Polignac number, because 13111110012001 - 27 = 13111110011873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13111110012061) 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, 471168076 + ... + 471195901.
It is an arithmetic number, because the mean of its divisors is an integer number (3278013097473).
Almost surely, 213111110012001 is an apocalyptic number.
It is an amenable number.
13111110012001 is a deficient number, since it is larger than the sum of its proper divisors (942377891).
13111110012001 is an equidigital number, since it uses as much as digits as its factorization.
13111110012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 942377890.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 13111110012001 its reverse (10021001111131), we get a palindrome (23132111123132).
The spelling of 13111110012001 in words is "thirteen trillion, one hundred eleven billion, one hundred ten million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •