Base | Representation |
---|---|
bin | 111000110100110000… |
… | …011011101101100101 |
3 | 12211111012211120002111 |
4 | 320310300123231211 |
5 | 1444424222410142 |
6 | 44010231441021 |
7 | 4260000000016 |
oct | 706460335545 |
9 | 184435746074 |
10 | 61014653797 |
11 | 239701aa519 |
12 | b9a9826171 |
13 | 59a4a28256 |
14 | 2d4b53700d |
15 | 18c187ae17 |
hex | e34c1bb65 |
61014653797 has 2 divisors, whose sum is σ = 61014653798. Its totient is φ = 61014653796.
The previous prime is 61014653779. The next prime is 61014653831. The reversal of 61014653797 is 79735641016.
Together with previous prime (61014653779) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 43051685121 + 17962968676 = 207489^2 + 134026^2 .
It is a cyclic number.
It is not a de Polignac number, because 61014653797 - 27 = 61014653669 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 61014653797.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61014653597) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30507326898 + 30507326899.
It is an arithmetic number, because the mean of its divisors is an integer number (30507326899).
Almost surely, 261014653797 is an apocalyptic number.
It is an amenable number.
61014653797 is a deficient number, since it is larger than the sum of its proper divisors (1).
61014653797 is an equidigital number, since it uses as much as digits as its factorization.
61014653797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 952560, while the sum is 49.
The spelling of 61014653797 in words is "sixty-one billion, fourteen million, six hundred fifty-three thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •