Base | Representation |
---|---|
bin | 11011111101100101011010… |
… | …11100101011010000001101 |
3 | 22001201100120020211220221200 |
4 | 31332302231130223100031 |
5 | 31024421311404110401 |
6 | 334435543300220113 |
7 | 15644324066250654 |
oct | 1576625534532015 |
9 | 261640506756850 |
10 | 61489661785101 |
11 | 1865768a055640 |
12 | 6a9113739a639 |
13 | 28405b11b9674 |
14 | 1128188d6019b |
15 | 719749532686 |
hex | 37ecad72b40d |
61489661785101 has 24 divisors (see below), whose sum is σ = 97063086594240. Its totient is φ = 37200966993600.
The previous prime is 61489661785073. The next prime is 61489661785103. The reversal of 61489661785101 is 10158716698416.
61489661785101 is a `hidden beast` number, since 6 + 1 + 4 + 8 + 9 + 6 + 617 + 8 + 5 + 1 + 0 + 1 = 666.
It is not a de Polignac number, because 61489661785101 - 230 = 61488588043277 is a prime.
It is a super-2 number, since 2×614896617851012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61489661785103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 545732505 + ... + 545845166.
It is an arithmetic number, because the mean of its divisors is an integer number (4044295274760).
Almost surely, 261489661785101 is an apocalyptic number.
It is an amenable number.
61489661785101 is a deficient number, since it is larger than the sum of its proper divisors (35573424809139).
61489661785101 is a wasteful number, since it uses less digits than its factorization.
61489661785101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1091578257 (or 1091578254 counting only the distinct ones).
The product of its (nonzero) digits is 17418240, while the sum is 63.
The spelling of 61489661785101 in words is "sixty-one trillion, four hundred eighty-nine billion, six hundred sixty-one million, seven hundred eighty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •