Base | Representation |
---|---|
bin | 1110101001100… |
… | …1010000011110 |
3 | 11021121201220022 |
4 | 3222121100132 |
5 | 111212221100 |
6 | 10032552142 |
7 | 1344163244 |
oct | 352312036 |
9 | 137551808 |
10 | 61445150 |
11 | 31758718 |
12 | 186b2652 |
13 | c9649a0 |
14 | 8236794 |
15 | 55dae85 |
hex | 3a9941e |
61445150 has 24 divisors (see below), whose sum is σ = 123080664. Its totient is φ = 22687200.
The previous prime is 61445147. The next prime is 61445159. The reversal of 61445150 is 5154416.
61445150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61445159) 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, 46616 + ... + 47915.
It is an arithmetic number, because the mean of its divisors is an integer number (5128361).
Almost surely, 261445150 is an apocalyptic number.
61445150 is an abundant number, since it is smaller than the sum of its proper divisors (61635514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61445150 is a wasteful number, since it uses less digits than its factorization.
61445150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94556 (or 94551 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 61445150 is about 7838.6956823186. The cubic root of 61445150 is about 394.6049567517.
Adding to 61445150 its reverse (5154416), we get a palindrome (66599566).
The spelling of 61445150 in words is "sixty-one million, four hundred forty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •