Base | Representation |
---|---|
bin | 1110100110010… |
… | …1001010011010 |
3 | 11021012220012100 |
4 | 3221211022122 |
5 | 111133404040 |
6 | 10024224230 |
7 | 1342314165 |
oct | 351451232 |
9 | 137186170 |
10 | 61231770 |
11 | 31622376 |
12 | 1860b076 |
13 | c8bb822 |
14 | 81bcadc |
15 | 5597b30 |
hex | 3a6529a |
61231770 has 24 divisors (see below), whose sum is σ = 159202836. Its totient is φ = 16328448.
The previous prime is 61231763. The next prime is 61231771. The reversal of 61231770 is 7713216.
61231770 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 51365889 + 9865881 = 7167^2 + 3141^2 .
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (61231771) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 340087 + ... + 340266.
Almost surely, 261231770 is an apocalyptic number.
61231770 is an abundant number, since it is smaller than the sum of its proper divisors (97971066).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61231770 is a wasteful number, since it uses less digits than its factorization.
61231770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680366 (or 680363 counting only the distinct ones).
The product of its (nonzero) digits is 1764, while the sum is 27.
The square root of 61231770 is about 7825.0731625973. The cubic root of 61231770 is about 394.1476466578.
Adding to 61231770 its reverse (7713216), we get a palindrome (68944986).
It can be divided in two parts, 61231 and 770, that added together give a square (62001 = 2492).
The spelling of 61231770 in words is "sixty-one million, two hundred thirty-one thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •