Base | Representation |
---|---|
bin | 10011100111100111000011… |
… | …11000001001011100010001 |
3 | 12122202101011220021120111202 |
4 | 21303303201320021130101 |
5 | 21123321204411111421 |
6 | 231431210331120545 |
7 | 12041636623556522 |
oct | 1163634170113421 |
9 | 178671156246452 |
10 | 43142441113361 |
11 | 12823674318547 |
12 | 4a093642a3155 |
13 | 1b0c41263b815 |
14 | a92168cc2849 |
15 | 4ec37962a10b |
hex | 273ce1e09711 |
43142441113361 has 2 divisors, whose sum is σ = 43142441113362. Its totient is φ = 43142441113360.
The previous prime is 43142441113271. The next prime is 43142441113391. The reversal of 43142441113361 is 16331114424134.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23030938491136 + 20111502622225 = 4799056^2 + 4484585^2 .
It is a cyclic number.
It is not a de Polignac number, because 43142441113361 - 226 = 43142374004497 is a prime.
It is a super-2 number, since 2×431424411133612 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (43142441113391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21571220556680 + 21571220556681.
It is an arithmetic number, because the mean of its divisors is an integer number (21571220556681).
Almost surely, 243142441113361 is an apocalyptic number.
It is an amenable number.
43142441113361 is a deficient number, since it is larger than the sum of its proper divisors (1).
43142441113361 is an equidigital number, since it uses as much as digits as its factorization.
43142441113361 is an evil number, because the sum of its binary digits is even.
The product of its digits is 82944, while the sum is 38.
Adding to 43142441113361 its reverse (16331114424134), we get a palindrome (59473555537495).
The spelling of 43142441113361 in words is "forty-three trillion, one hundred forty-two billion, four hundred forty-one million, one hundred thirteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •