Base | Representation |
---|---|
bin | 10111011110011111010… |
… | …110111110111000000101 |
3 | 12201020011200212101101211 |
4 | 113132133112332320011 |
5 | 202413002300304203 |
6 | 3233044501051421 |
7 | 224361511420345 |
oct | 27363726767005 |
9 | 5636150771354 |
10 | 1613286338053 |
11 | 572211096965 |
12 | 2207ba3b6b71 |
13 | b9194721230 |
14 | 581250b0d25 |
15 | 2be72c46c6d |
hex | 1779f5bee05 |
1613286338053 has 8 divisors (see below), whose sum is σ = 1738977772896. Its totient is φ = 1487822401200.
The previous prime is 1613286338051. The next prime is 1613286338071. The reversal of 1613286338053 is 3508336823161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1613286338053 - 21 = 1613286338051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1613286337988 and 1613286338006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1613286338051) 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, 56859763 + ... + 56888128.
It is an arithmetic number, because the mean of its divisors is an integer number (217372221612).
Almost surely, 21613286338053 is an apocalyptic number.
1613286338053 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1613286338053 is a deficient number, since it is larger than the sum of its proper divisors (125691434843).
1613286338053 is a wasteful number, since it uses less digits than its factorization.
1613286338053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113748995.
The product of its (nonzero) digits is 1866240, while the sum is 49.
The spelling of 1613286338053 in words is "one trillion, six hundred thirteen billion, two hundred eighty-six million, three hundred thirty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •