Base | Representation |
---|---|
bin | 111001000110001100… |
… | …000011100100011101 |
3 | 12212020121010202022022 |
4 | 321012030003210131 |
5 | 2001024104420423 |
6 | 44055240025525 |
7 | 4300150550033 |
oct | 710614034435 |
9 | 185217122268 |
10 | 61307107613 |
11 | 2400029a394 |
12 | ba6b7622a5 |
13 | 5a204b334b |
14 | 2d78304553 |
15 | 18dc398dc8 |
hex | e4630391d |
61307107613 has 4 divisors (see below), whose sum is σ = 61321945308. Its totient is φ = 61292269920.
The previous prime is 61307107579. The next prime is 61307107657. The reversal of 61307107613 is 31670170316.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 41960244964 + 19346862649 = 204842^2 + 139093^2 .
It is a cyclic number.
It is not a de Polignac number, because 61307107613 - 214 = 61307091229 is a prime.
It is a super-2 number, since 2×613071076132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61307107513) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7412648 + ... + 7420913.
It is an arithmetic number, because the mean of its divisors is an integer number (15330486327).
Almost surely, 261307107613 is an apocalyptic number.
It is an amenable number.
61307107613 is a deficient number, since it is larger than the sum of its proper divisors (14837695).
61307107613 is a wasteful number, since it uses less digits than its factorization.
61307107613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14837694.
The product of its (nonzero) digits is 15876, while the sum is 35.
Adding to 61307107613 its reverse (31670170316), we get a palindrome (92977277929).
The spelling of 61307107613 in words is "sixty-one billion, three hundred seven million, one hundred seven thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •