Base | Representation |
---|---|
bin | 1110100100010… |
… | …1001111010100 |
3 | 11020222020211110 |
4 | 3221011033110 |
5 | 111120213022 |
6 | 10021335020 |
7 | 1341231030 |
oct | 351051724 |
9 | 136866743 |
10 | 61101012 |
11 | 31543105 |
12 | 18567470 |
13 | c87415b |
14 | 81871c0 |
15 | 556e00c |
hex | 3a453d4 |
61101012 has 48 divisors (see below), whose sum is σ = 163320192. Its totient is φ = 17416320.
The previous prime is 61101011. The next prime is 61101037. The reversal of 61101012 is 21010116.
It is a happy number.
61101012 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 (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61101011) 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 15 ways as a sum of consecutive naturals, for example, 64462 + ... + 65402.
It is an arithmetic number, because the mean of its divisors is an integer number (3402504).
Almost surely, 261101012 is an apocalyptic number.
It is an amenable number.
61101012 is an abundant number, since it is smaller than the sum of its proper divisors (102219180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61101012 is a wasteful number, since it uses less digits than its factorization.
61101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1728 (or 1726 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 61101012 is about 7816.7136316997. The cubic root of 61101012 is about 393.8668845234.
Adding to 61101012 its reverse (21010116), we get a palindrome (82111128).
The spelling of 61101012 in words is "sixty-one million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •