Base | Representation |
---|---|
bin | 11011101111110011010001… |
… | …11100101101000011110101 |
3 | 22000001002010120002221212202 |
4 | 31313321220330231003311 |
5 | 30444141400413310040 |
6 | 333434221022154245 |
7 | 15565156666630004 |
oct | 1567715074550365 |
9 | 260032116087782 |
10 | 61016066150645 |
11 | 1849484a724851 |
12 | 6a153a5122985 |
13 | 2807a37521938 |
14 | 110d29c810c3b |
15 | 70c27ba2a015 |
hex | 377e68f2d0f5 |
61016066150645 has 4 divisors (see below), whose sum is σ = 73219279380780. Its totient is φ = 48812852920512.
The previous prime is 61016066150587. The next prime is 61016066150731. The reversal of 61016066150645 is 54605166061016.
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 7121762207569 + 53894303943076 = 2668663^2 + 7341274^2 .
It is a cyclic number.
It is not a de Polignac number, because 61016066150645 - 228 = 61015797715189 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 61016066150645.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6101606615060 + ... + 6101606615069.
It is an arithmetic number, because the mean of its divisors is an integer number (18304819845195).
Almost surely, 261016066150645 is an apocalyptic number.
It is an amenable number.
61016066150645 is a deficient number, since it is larger than the sum of its proper divisors (12203213230135).
61016066150645 is a wasteful number, since it uses less digits than its factorization.
61016066150645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12203213230134.
The product of its (nonzero) digits is 777600, while the sum is 47.
The spelling of 61016066150645 in words is "sixty-one trillion, sixteen billion, sixty-six million, one hundred fifty thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •