Base | Representation |
---|---|
bin | 11100000000110011101101… |
… | …10010110111111110100001 |
3 | 22002002221102202200202001112 |
4 | 32000121312302313332201 |
5 | 31033230121441212301 |
6 | 335002501200513105 |
7 | 15655324453513526 |
oct | 1600316662677641 |
9 | 262087382622045 |
10 | 61600414007201 |
11 | 1869a652873303 |
12 | 6aaa6a601b795 |
13 | 284ab814ab5b4 |
14 | 112d693dd314d |
15 | 71c57c6b59bb |
hex | 380676cb7fa1 |
61600414007201 has 8 divisors (see below), whose sum is σ = 61606402934400. Its totient is φ = 61594425407680.
The previous prime is 61600414007161. The next prime is 61600414007267. The reversal of 61600414007201 is 10270041400616.
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-61600414007201 is a prime.
It is a super-2 number, since 2×616004140072012 (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 (61600414507201) 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, 525367340 + ... + 525484578.
It is an arithmetic number, because the mean of its divisors is an integer number (7700800366800).
Almost surely, 261600414007201 is an apocalyptic number.
It is an amenable number.
61600414007201 is a deficient number, since it is larger than the sum of its proper divisors (5988927199).
61600414007201 is a wasteful number, since it uses less digits than its factorization.
61600414007201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163839.
The product of its (nonzero) digits is 8064, while the sum is 32.
Adding to 61600414007201 its reverse (10270041400616), we get a palindrome (71870455407817).
The spelling of 61600414007201 in words is "sixty-one trillion, six hundred billion, four hundred fourteen million, seven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •