Base | Representation |
---|---|
bin | 1110100011110… |
… | …1111011111101 |
3 | 11020220201210122 |
4 | 3220331323331 |
5 | 111113233401 |
6 | 10020544325 |
7 | 1341044600 |
oct | 350757375 |
9 | 136821718 |
10 | 61071101 |
11 | 31522693 |
12 | 185520a5 |
13 | c863660 |
14 | 817a337 |
15 | 556521b |
hex | 3a3defd |
61071101 has 12 divisors (see below), whose sum is σ = 76507452. Its totient is φ = 48319488.
The previous prime is 61071091. The next prime is 61071119. The reversal of 61071101 is 10117016.
It can be written as a sum of positive squares in 2 ways, for example, as 21996100 + 39075001 = 4690^2 + 6251^2 .
It is not a de Polignac number, because 61071101 - 26 = 61071037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 61071101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61071121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 47300 + ... + 48573.
It is an arithmetic number, because the mean of its divisors is an integer number (6375621).
Almost surely, 261071101 is an apocalyptic number.
It is an amenable number.
61071101 is a deficient number, since it is larger than the sum of its proper divisors (15436351).
61071101 is a wasteful number, since it uses less digits than its factorization.
61071101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95900 (or 95893 counting only the distinct ones).
The product of its (nonzero) digits is 42, while the sum is 17.
The square root of 61071101 is about 7814.8001254031. The cubic root of 61071101 is about 393.8026036716.
Adding to 61071101 its reverse (10117016), we get a palindrome (71188117).
The spelling of 61071101 in words is "sixty-one million, seventy-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •