Base | Representation |
---|---|
bin | 1110101001101… |
… | …1111100000011 |
3 | 11021122021222000 |
4 | 3222123330003 |
5 | 111213044011 |
6 | 10033115043 |
7 | 1344240252 |
oct | 352337403 |
9 | 137567860 |
10 | 61456131 |
11 | 317659a0 |
12 | 186b8a83 |
13 | c969999 |
14 | 823a799 |
15 | 55de356 |
hex | 3a9bf03 |
61456131 has 16 divisors (see below), whose sum is σ = 99323520. Its totient is φ = 37245960.
The previous prime is 61456117. The next prime is 61456163. The reversal of 61456131 is 13165416.
61456131 is a `hidden beast` number, since 6 + 1 + 45 + 613 + 1 = 666.
It is not a de Polignac number, because 61456131 - 25 = 61456099 is a prime.
It is a super-2 number, since 2×614561312 = 7553712074978322, which contains 22 as substring.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 61456095 and 61456104.
It is not an unprimeable number, because it can be changed into a prime (61456531) 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, 103165 + ... + 103758.
It is an arithmetic number, because the mean of its divisors is an integer number (6207720).
Almost surely, 261456131 is an apocalyptic number.
61456131 is a deficient number, since it is larger than the sum of its proper divisors (37867389).
61456131 is a wasteful number, since it uses less digits than its factorization.
61456131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206943 (or 206937 counting only the distinct ones).
The product of its digits is 2160, while the sum is 27.
The square root of 61456131 is about 7839.3960864342. The cubic root of 61456131 is about 394.6284622626.
The spelling of 61456131 in words is "sixty-one million, four hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •