Base | Representation |
---|---|
bin | 1110100101000… |
… | …1001110010101 |
3 | 11021001202011120 |
4 | 3221101032111 |
5 | 111123300401 |
6 | 10022354153 |
7 | 1341524115 |
oct | 351211625 |
9 | 137052146 |
10 | 61150101 |
11 | 31576a81 |
12 | 1858b959 |
13 | c8905bc |
14 | 819b045 |
15 | 557d836 |
hex | 3a51395 |
61150101 has 4 divisors (see below), whose sum is σ = 81533472. Its totient is φ = 40766732.
The previous prime is 61150097. The next prime is 61150109. The reversal of 61150101 is 10105116.
61150101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 61150101 - 22 = 61150097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61150109) 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 3 ways as a sum of consecutive naturals, for example, 10191681 + ... + 10191686.
It is an arithmetic number, because the mean of its divisors is an integer number (20383368).
Almost surely, 261150101 is an apocalyptic number.
It is an amenable number.
61150101 is a deficient number, since it is larger than the sum of its proper divisors (20383371).
61150101 is a wasteful number, since it uses less digits than its factorization.
61150101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20383370.
The product of its (nonzero) digits is 30, while the sum is 15.
The square root of 61150101 is about 7819.8530037335. The cubic root of 61150101 is about 393.9723348007.
Adding to 61150101 its reverse (10105116), we get a palindrome (71255217).
The spelling of 61150101 in words is "sixty-one million, one hundred fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •