Base | Representation |
---|---|
bin | 1011111011000111110010… |
… | …0100011111111001010011 |
3 | 1201102100001110002211212201 |
4 | 2332301330210133321103 |
5 | 3204244424003130003 |
6 | 43514445202104031 |
7 | 2522122126261111 |
oct | 276617444377123 |
9 | 51370043084781 |
10 | 13110330130003 |
11 | 41a5072633417 |
12 | 1578a5304b017 |
13 | 7413b66a2302 |
14 | 334786dc2ab1 |
15 | 17b06a740b1d |
hex | bec7c91fe53 |
13110330130003 has 4 divisors (see below), whose sum is σ = 13164729840328. Its totient is φ = 13055930419680.
The previous prime is 13110330129943. The next prime is 13110330130043. The reversal of 13110330130003 is 30003103301131.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13110330130003 is a prime.
It is a super-2 number, since 2×131103301300032 (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 (13110330130043) 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, 27199854801 + ... + 27199855282.
It is an arithmetic number, because the mean of its divisors is an integer number (3291182460082).
Almost surely, 213110330130003 is an apocalyptic number.
13110330130003 is a deficient number, since it is larger than the sum of its proper divisors (54399710325).
13110330130003 is an equidigital number, since it uses as much as digits as its factorization.
13110330130003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54399710324.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 13110330130003 its reverse (30003103301131), we get a palindrome (43113433431134).
The spelling of 13110330130003 in words is "thirteen trillion, one hundred ten billion, three hundred thirty million, one hundred thirty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •