Base | Representation |
---|---|
bin | 1011111011001010110001… |
… | …0011100111011110111011 |
3 | 1201102102010021002211001222 |
4 | 2332302230103213132323 |
5 | 3204303044014323003 |
6 | 43515100451502255 |
7 | 2522151022534124 |
oct | 276625423473673 |
9 | 51372107084058 |
10 | 13111131011003 |
11 | 41a5443716143 |
12 | 15790372b798b |
13 | 7414b35a31ac |
14 | 3348214db04b |
15 | 17b0b5bddc38 |
hex | becac4e77bb |
13111131011003 has 8 divisors (see below), whose sum is σ = 13144343430240. Its totient is φ = 13077944372160.
The previous prime is 13111131010997. The next prime is 13111131011009. The reversal of 13111131011003 is 30011013111131.
It is an interprime number because it is at equal distance from previous prime (13111131010997) and next prime (13111131011009).
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-13111131011003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13111131011009) 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, 5426468 + ... + 7461153.
It is an arithmetic number, because the mean of its divisors is an integer number (1643042928780).
Almost surely, 213111131011003 is an apocalyptic number.
13111131011003 is a deficient number, since it is larger than the sum of its proper divisors (33212419237).
13111131011003 is a wasteful number, since it uses less digits than its factorization.
13111131011003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12890197.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 13111131011003 its reverse (30011013111131), we get a palindrome (43122144122134).
The spelling of 13111131011003 in words is "thirteen trillion, one hundred eleven billion, one hundred thirty-one million, eleven thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •