Base | Representation |
---|---|
bin | 11011010101010100001110… |
… | …01010100010000011100001 |
3 | 21212211002012021101221022011 |
4 | 31222222013022202003201 |
5 | 30334234132221302223 |
6 | 331500200020112521 |
7 | 15442342463324242 |
oct | 1552520712420341 |
9 | 255732167357264 |
10 | 60106040025313 |
11 | 181739126a6667 |
12 | 68a8b53235741 |
13 | 276cc8a82bbb9 |
14 | 10bb20da24cc9 |
15 | 6e37691ce80d |
hex | 36aa872a20e1 |
60106040025313 has 8 divisors (see below), whose sum is σ = 61126125651360. Its totient is φ = 59085999038880.
The previous prime is 60106040025293. The next prime is 60106040025377. The reversal of 60106040025313 is 31352004060106.
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 60106040025313 - 221 = 60106037928161 is a prime.
It is a super-2 number, since 2×601060400253132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (60106040025413) 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, 8438523 + ... + 13835488.
It is an arithmetic number, because the mean of its divisors is an integer number (7640765706420).
Almost surely, 260106040025313 is an apocalyptic number.
It is an amenable number.
60106040025313 is a deficient number, since it is larger than the sum of its proper divisors (1020085626047).
60106040025313 is a wasteful number, since it uses less digits than its factorization.
60106040025313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22319807.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 60106040025313 its reverse (31352004060106), we get a palindrome (91458044085419).
The spelling of 60106040025313 in words is "sixty trillion, one hundred six billion, forty million, twenty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •