Base | Representation |
---|---|
bin | 1110100011000… |
… | …1100110010111 |
3 | 11020211011111000 |
4 | 3220301212113 |
5 | 111110124232 |
6 | 10015514343 |
7 | 1340444346 |
oct | 350614627 |
9 | 136734430 |
10 | 61020567 |
11 | 31498723 |
12 | 185289b3 |
13 | c84665a |
14 | 8165b5d |
15 | 555527c |
hex | 3a31997 |
61020567 has 16 divisors (see below), whose sum is σ = 90837760. Its totient is φ = 40483800.
The previous prime is 61020559. The next prime is 61020577. The reversal of 61020567 is 76502016.
It is not a de Polignac number, because 61020567 - 23 = 61020559 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 61020567.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61020527) 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, 342 + ... + 11052.
It is an arithmetic number, because the mean of its divisors is an integer number (5677360).
Almost surely, 261020567 is an apocalyptic number.
61020567 is a deficient number, since it is larger than the sum of its proper divisors (29817193).
61020567 is a wasteful number, since it uses less digits than its factorization.
61020567 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10931 (or 10925 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 61020567 is about 7811.5662321970. The cubic root of 61020567 is about 393.6939548349.
The spelling of 61020567 in words is "sixty-one million, twenty thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •