Base | Representation |
---|---|
bin | 100100001111100… |
… | …1101100011100101 |
3 | 10010202101101120022 |
4 | 1020133031203211 |
5 | 4442313012131 |
6 | 320402044525 |
7 | 42065014106 |
oct | 11037154345 |
9 | 3122341508 |
10 | 1216141541 |
11 | 57453115a |
12 | 29b349745 |
13 | 164c565a4 |
14 | b77323ad |
15 | 71b7837b |
hex | 487cd8e5 |
1216141541 has 2 divisors, whose sum is σ = 1216141542. Its totient is φ = 1216141540.
The previous prime is 1216141519. The next prime is 1216141547. The reversal of 1216141541 is 1451416121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1207562500 + 8579041 = 34750^2 + 2929^2 .
It is an emirp because it is prime and its reverse (1451416121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1216141541 - 218 = 1215879397 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1216141541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1216141547) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 608070770 + 608070771.
It is an arithmetic number, because the mean of its divisors is an integer number (608070771).
Almost surely, 21216141541 is an apocalyptic number.
It is an amenable number.
1216141541 is a deficient number, since it is larger than the sum of its proper divisors (1).
1216141541 is an equidigital number, since it uses as much as digits as its factorization.
1216141541 is an evil number, because the sum of its binary digits is even.
The product of its digits is 960, while the sum is 26.
The square root of 1216141541 is about 34873.2209725457. The cubic root of 1216141541 is about 1067.4020710660.
Adding to 1216141541 its reverse (1451416121), we get a palindrome (2667557662).
The spelling of 1216141541 in words is "one billion, two hundred sixteen million, one hundred forty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •