Base | Representation |
---|---|
bin | 110101100111100010… |
… | …0100010110101101001 |
3 | 102000012112021212021002 |
4 | 1223033010202311221 |
5 | 3341303131142211 |
6 | 124521314524345 |
7 | 11214233155412 |
oct | 1531704426551 |
9 | 360175255232 |
10 | 115143224681 |
11 | 44917391a21 |
12 | 1a3952966b5 |
13 | ab1cc24814 |
14 | 58042c8809 |
15 | 2edd8e103b |
hex | 1acf122d69 |
115143224681 has 2 divisors, whose sum is σ = 115143224682. Its totient is φ = 115143224680.
The previous prime is 115143224513. The next prime is 115143224683. The reversal of 115143224681 is 186422341511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111035568400 + 4107656281 = 333220^2 + 64091^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115143224681 is a prime.
It is a super-2 number, since 2×1151432246812 (a number of 23 digits) contains 22 as substring.
Together with 115143224683, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (115143224683) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57571612340 + 57571612341.
It is an arithmetic number, because the mean of its divisors is an integer number (57571612341).
Almost surely, 2115143224681 is an apocalyptic number.
It is an amenable number.
115143224681 is a deficient number, since it is larger than the sum of its proper divisors (1).
115143224681 is an equidigital number, since it uses as much as digits as its factorization.
115143224681 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 46080, while the sum is 38.
The spelling of 115143224681 in words is "one hundred fifteen billion, one hundred forty-three million, two hundred twenty-four thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •