Base | Representation |
---|---|
bin | 11011110011100011110110… |
… | …11010110010100110101100 |
3 | 22000111102111212100200110010 |
4 | 31321301323122302212230 |
5 | 31003300410102441234 |
6 | 334013421213413220 |
7 | 15610411451263350 |
oct | 1571617332624654 |
9 | 260442455320403 |
10 | 61145225046444 |
11 | 185345a9538940 |
12 | 6a3643019a210 |
13 | 2816c7c081276 |
14 | 11156322d1460 |
15 | 7107daae76e9 |
hex | 379c7b6b29ac |
61145225046444 has 48 divisors (see below), whose sum is σ = 177877018319616. Its totient is φ = 15881876635200.
The previous prime is 61145225046439. The next prime is 61145225046449. The reversal of 61145225046444 is 44464052254116.
It is an interprime number because it is at equal distance from previous prime (61145225046439) and next prime (61145225046449).
It is a junction number, because it is equal to n+sod(n) for n = 61145225046393 and 61145225046402.
It is not an unprimeable number, because it can be changed into a prime (61145225046449) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33087242067 + ... + 33087243914.
It is an arithmetic number, because the mean of its divisors is an integer number (3705771214992).
Almost surely, 261145225046444 is an apocalyptic number.
It is an amenable number.
61145225046444 is an abundant number, since it is smaller than the sum of its proper divisors (116731793273172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61145225046444 is a wasteful number, since it uses less digits than its factorization.
61145225046444 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66174486006 (or 66174486004 counting only the distinct ones).
The product of its (nonzero) digits is 3686400, while the sum is 48.
The spelling of 61145225046444 in words is "sixty-one trillion, one hundred forty-five billion, two hundred twenty-five million, forty-six thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •