Base | Representation |
---|---|
bin | 110000001010110… |
… | …0000100100000101 |
3 | 11011122021001202101 |
4 | 1200111200210011 |
5 | 11302230014031 |
6 | 424213512101 |
7 | 55023623311 |
oct | 14025404405 |
9 | 4148231671 |
10 | 1616251141 |
11 | 75a37144a |
12 | 391342631 |
13 | 1c9b05a2b |
14 | 114924b41 |
15 | 96d5e361 |
hex | 60560905 |
1616251141 has 2 divisors, whose sum is σ = 1616251142. Its totient is φ = 1616251140.
The previous prime is 1616251129. The next prime is 1616251199. The reversal of 1616251141 is 1411526161.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 884765025 + 731486116 = 29745^2 + 27046^2 .
It is an emirp because it is prime and its reverse (1411526161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1616251141 - 213 = 1616242949 is a prime.
It is a super-2 number, since 2×16162511412 = 5224535501567603762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1616251121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 808125570 + 808125571.
It is an arithmetic number, because the mean of its divisors is an integer number (808125571).
Almost surely, 21616251141 is an apocalyptic number.
It is an amenable number.
1616251141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1616251141 is an equidigital number, since it uses as much as digits as its factorization.
1616251141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1440, while the sum is 28.
The square root of 1616251141 is about 40202.6260460682. The cubic root of 1616251141 is about 1173.5536490039.
The spelling of 1616251141 in words is "one billion, six hundred sixteen million, two hundred fifty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •