Base | Representation |
---|---|
bin | 10000100111000011010… |
… | …101101001100101111101 |
3 | 11001010021011110001102202 |
4 | 100213003111221211331 |
5 | 122200134023102244 |
6 | 2232212201001245 |
7 | 145316015140301 |
oct | 20470325514575 |
9 | 4033234401382 |
10 | 1141443565949 |
11 | 4000a1154545 |
12 | 165277183225 |
13 | 83839c50c6b |
14 | 3d363687d01 |
15 | 1ea5908604e |
hex | 109c356997d |
1141443565949 has 2 divisors, whose sum is σ = 1141443565950. Its totient is φ = 1141443565948.
The previous prime is 1141443565891. The next prime is 1141443565961. The reversal of 1141443565949 is 9495653441411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1104090273049 + 37353292900 = 1050757^2 + 193270^2 .
It is a cyclic number.
It is not a de Polignac number, because 1141443565949 - 232 = 1137148598653 is a prime.
It is a super-2 number, since 2×11414435659492 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1141443565894 and 1141443565903.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1141443565979) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570721782974 + 570721782975.
It is an arithmetic number, because the mean of its divisors is an integer number (570721782975).
Almost surely, 21141443565949 is an apocalyptic number.
It is an amenable number.
1141443565949 is a deficient number, since it is larger than the sum of its proper divisors (1).
1141443565949 is an equidigital number, since it uses as much as digits as its factorization.
1141443565949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9331200, while the sum is 56.
The spelling of 1141443565949 in words is "one trillion, one hundred forty-one billion, four hundred forty-three million, five hundred sixty-five thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •