Base | Representation |
---|---|
bin | 1110100011000… |
… | …0101000110001 |
3 | 11020210222002000 |
4 | 3220300220301 |
5 | 111110013000 |
6 | 10015444213 |
7 | 1340430015 |
oct | 350605061 |
9 | 136728060 |
10 | 61016625 |
11 | 3149576a |
12 | 18526669 |
13 | c844917 |
14 | 8164545 |
15 | 5554000 |
hex | 3a30a31 |
61016625 has 64 divisors (see below), whose sum is σ = 114566400. Its totient is φ = 32040000.
The previous prime is 61016617. The next prime is 61016633. The reversal of 61016625 is 52661016.
61016625 = 4462 + 4472 + ... + 6472.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (61016617) and next prime (61016633).
It is not a de Polignac number, because 61016625 - 23 = 61016617 is a prime.
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 nialpdrome in base 15.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 340786 + ... + 340964.
It is an arithmetic number, because the mean of its divisors is an integer number (1790100).
Almost surely, 261016625 is an apocalyptic number.
It is an amenable number.
61016625 is a deficient number, since it is larger than the sum of its proper divisors (53549775).
61016625 is a wasteful number, since it uses less digits than its factorization.
61016625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304 (or 288 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 61016625 is about 7811.3139099642. The cubic root of 61016625 is about 393.6854769557.
The spelling of 61016625 in words is "sixty-one million, sixteen thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •