Base | Representation |
---|---|
bin | 11011111011011101010111… |
… | …10101010011001011001101 |
3 | 22001110101000212022001210021 |
4 | 31331232223311103023031 |
5 | 31022222214240212423 |
6 | 334342223354342141 |
7 | 15636130050341410 |
oct | 1575565365231315 |
9 | 261411025261707 |
10 | 61416620241613 |
11 | 18629707aa896a |
12 | 6a7ab51a2a951 |
13 | 28367408a3550 |
14 | 112481a409b77 |
15 | 7178c1dc395d |
hex | 37dbabd532cd |
61416620241613 has 64 divisors (see below), whose sum is σ = 81706237634560. Its totient is φ = 44806320453888.
The previous prime is 61416620241611. The next prime is 61416620241617. The reversal of 61416620241613 is 31614202661416.
It is not a de Polignac number, because 61416620241613 - 21 = 61416620241611 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a self number, because there is not a number n which added to its sum of digits gives 61416620241613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61416620241611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 19580695 + ... + 22499707.
It is an arithmetic number, because the mean of its divisors is an integer number (1276659963040).
Almost surely, 261416620241613 is an apocalyptic number.
It is an amenable number.
61416620241613 is a deficient number, since it is larger than the sum of its proper divisors (20289617392947).
61416620241613 is a wasteful number, since it uses less digits than its factorization.
61416620241613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2919378.
The product of its (nonzero) digits is 248832, while the sum is 43.
The spelling of 61416620241613 in words is "sixty-one trillion, four hundred sixteen billion, six hundred twenty million, two hundred forty-one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •