Base | Representation |
---|---|
bin | 1110100110010… |
… | …1101000101001 |
3 | 11021012222212000 |
4 | 3221211220221 |
5 | 111133434310 |
6 | 10024241213 |
7 | 1342322631 |
oct | 351455051 |
9 | 137188760 |
10 | 61233705 |
11 | 31623875 |
12 | 18610209 |
13 | c8bc680 |
14 | 81bd6c1 |
15 | 55984c0 |
hex | 3a65a29 |
61233705 has 128 divisors (see below), whose sum is σ = 128701440. Its totient is φ = 27371520.
The previous prime is 61233673. The next prime is 61233727. The reversal of 61233705 is 50733216.
It is a happy number.
61233705 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 61233705 - 25 = 61233673 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 127 ways as a sum of consecutive naturals, for example, 1493485 + ... + 1493525.
It is an arithmetic number, because the mean of its divisors is an integer number (1005480).
Almost surely, 261233705 is an apocalyptic number.
61233705 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
61233705 is an abundant number, since it is smaller than the sum of its proper divisors (67467735).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61233705 is a wasteful number, since it uses less digits than its factorization.
61233705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128 (or 122 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 27.
The square root of 61233705 is about 7825.1968026370. The cubic root of 61233705 is about 394.1517984659.
The spelling of 61233705 in words is "sixty-one million, two hundred thirty-three thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •