Base | Representation |
---|---|
bin | 111000110110011110… |
… | …010010100010000101 |
3 | 12211120020000122211222 |
4 | 320312132102202011 |
5 | 2000004110431122 |
6 | 44013141010125 |
7 | 4260466531631 |
oct | 706636224205 |
9 | 184506018758 |
10 | 61043452037 |
11 | 2398548a017 |
12 | b9b73b3945 |
13 | 59aa99c229 |
14 | 2d512b1dc1 |
15 | 18c4168b42 |
hex | e36792885 |
61043452037 has 4 divisors (see below), whose sum is σ = 61063796076. Its totient is φ = 61023108000.
The previous prime is 61043452027. The next prime is 61043452061. The reversal of 61043452037 is 73025434016.
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 18999589921 + 42043862116 = 137839^2 + 205046^2 .
It is a cyclic number.
It is not a de Polignac number, because 61043452037 - 210 = 61043451013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 61043451988 and 61043452006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61043452007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10167518 + ... + 10173519.
It is an arithmetic number, because the mean of its divisors is an integer number (15265949019).
Almost surely, 261043452037 is an apocalyptic number.
It is an amenable number.
61043452037 is a deficient number, since it is larger than the sum of its proper divisors (20344039).
61043452037 is a wasteful number, since it uses less digits than its factorization.
61043452037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20344038.
The product of its (nonzero) digits is 60480, while the sum is 35.
The spelling of 61043452037 in words is "sixty-one billion, forty-three million, four hundred fifty-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •