Base | Representation |
---|---|
bin | 1010011100111110… |
… | …00011000011110101 |
3 | 112111002110101012001 |
4 | 11032133003003311 |
5 | 42443100313031 |
6 | 2324502455301 |
7 | 256030624234 |
oct | 51637030365 |
9 | 15432411161 |
10 | 5611729141 |
11 | 241a747187 |
12 | 1107434531 |
13 | 6b58030b5 |
14 | 3b341cb1b |
15 | 22c9de861 |
hex | 14e7c30f5 |
5611729141 has 2 divisors, whose sum is σ = 5611729142. Its totient is φ = 5611729140.
The previous prime is 5611729139. The next prime is 5611729153. The reversal of 5611729141 is 1419271165.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5486513041 + 125216100 = 74071^2 + 11190^2 .
It is a cyclic number.
It is not a de Polignac number, because 5611729141 - 21 = 5611729139 is a prime.
Together with 5611729139, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 5611729141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5611729241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2805864570 + 2805864571.
It is an arithmetic number, because the mean of its divisors is an integer number (2805864571).
Almost surely, 25611729141 is an apocalyptic number.
It is an amenable number.
5611729141 is a deficient number, since it is larger than the sum of its proper divisors (1).
5611729141 is an equidigital number, since it uses as much as digits as its factorization.
5611729141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 15120, while the sum is 37.
The square root of 5611729141 is about 74911.4753625905. The cubic root of 5611729141 is about 1777.0469426237.
It can be divided in two parts, 56117 and 29141, that added together give a palindrome (85258).
The spelling of 5611729141 in words is "five billion, six hundred eleven million, seven hundred twenty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •