Base | Representation |
---|---|
bin | 1110110000000… |
… | …1001101110101 |
3 | 11022102101000020 |
4 | 3230001031311 |
5 | 111314332330 |
6 | 10050035353 |
7 | 1350615552 |
oct | 354011565 |
9 | 138371006 |
10 | 61870965 |
11 | 31a19632 |
12 | 18878b59 |
13 | ca83750 |
14 | 8307a29 |
15 | 5672210 |
hex | 3b01375 |
61870965 has 32 divisors (see below), whose sum is σ = 107740416. Its totient is φ = 30136320.
The previous prime is 61870901. The next prime is 61870979. The reversal of 61870965 is 56907816.
61870965 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 61870965 - 26 = 61870901 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17280 + ... + 20550.
It is an arithmetic number, because the mean of its divisors is an integer number (3366888).
Almost surely, 261870965 is an apocalyptic number.
61870965 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
61870965 is a deficient number, since it is larger than the sum of its proper divisors (45869451).
61870965 is a wasteful number, since it uses less digits than its factorization.
61870965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3389.
The product of its (nonzero) digits is 90720, while the sum is 42.
The square root of 61870965 is about 7865.8098756581. The cubic root of 61870965 is about 395.5143968552.
It can be divided in two parts, 61870 and 965, that added together give a triangular number (62835 = T354).
The spelling of 61870965 in words is "sixty-one million, eight hundred seventy thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •