Base | Representation |
---|---|
bin | 1011111011001110011001… |
… | …0000100111100010010001 |
3 | 1201102111122000122101101021 |
4 | 2332303212100213202101 |
5 | 3204312041421201223 |
6 | 43515341143235441 |
7 | 2522214100064440 |
oct | 276634620474221 |
9 | 51374560571337 |
10 | 13112103303313 |
11 | 41a58a2534803 |
12 | 1579268a48b81 |
13 | 741609b5b8a1 |
14 | 3348b46b4d57 |
15 | 17b12124a65d |
hex | bece6427891 |
13112103303313 has 8 divisors (see below), whose sum is σ = 14985849864128. Its totient is φ = 11238503979024.
The previous prime is 13112103303311. The next prime is 13112103303317. The reversal of 13112103303313 is 31330330121131.
13112103303313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13112103303313 - 21 = 13112103303311 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13112103303311) 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, 36618231 + ... + 36974572.
It is an arithmetic number, because the mean of its divisors is an integer number (1873231233016).
Almost surely, 213112103303313 is an apocalyptic number.
It is an amenable number.
13112103303313 is a deficient number, since it is larger than the sum of its proper divisors (1873746560815).
13112103303313 is an equidigital number, since it uses as much as digits as its factorization.
13112103303313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73618263.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 13112103303313 its reverse (31330330121131), we get a palindrome (44442433424444).
The spelling of 13112103303313 in words is "thirteen trillion, one hundred twelve billion, one hundred three million, three hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •