Base | Representation |
---|---|
bin | 100111111110111… |
… | …0111000000001101 |
3 | 10110111111011100201 |
4 | 1033331313000031 |
5 | 10221423204031 |
6 | 341043253501 |
7 | 45150356215 |
oct | 11775670015 |
9 | 3414434321 |
10 | 1341616141 |
11 | 629342078 |
12 | 31537a291 |
13 | 184c49308 |
14 | ca275245 |
15 | 7cbb0d61 |
hex | 4ff7700d |
1341616141 has 2 divisors, whose sum is σ = 1341616142. Its totient is φ = 1341616140.
The previous prime is 1341616139. The next prime is 1341616169. The reversal of 1341616141 is 1416161431.
It is an a-pointer prime, because the next prime (1341616169) can be obtained adding 1341616141 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1334075625 + 7540516 = 36525^2 + 2746^2 .
It is a cyclic number.
It is not a de Polignac number, because 1341616141 - 21 = 1341616139 is a prime.
Together with 1341616139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1341616121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 670808070 + 670808071.
It is an arithmetic number, because the mean of its divisors is an integer number (670808071).
Almost surely, 21341616141 is an apocalyptic number.
It is an amenable number.
1341616141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1341616141 is an equidigital number, since it uses as much as digits as its factorization.
1341616141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1728, while the sum is 28.
The square root of 1341616141 is about 36628.0785873352. The cubic root of 1341616141 is about 1102.9168155377.
Adding to 1341616141 its reverse (1416161431), we get a palindrome (2757777572).
The spelling of 1341616141 in words is "one billion, three hundred forty-one million, six hundred sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •