Base | Representation |
---|---|
bin | 110101100111100010… |
… | …0100010110011000001 |
3 | 102000012112021212000212 |
4 | 1223033010202303001 |
5 | 3341303131141023 |
6 | 124521314523505 |
7 | 11214233155052 |
oct | 1531704426301 |
9 | 360175255025 |
10 | 115143224513 |
11 | 44917391889 |
12 | 1a395296595 |
13 | ab1cc24715 |
14 | 58042c8729 |
15 | 2edd8e0e78 |
hex | 1acf122cc1 |
115143224513 has 2 divisors, whose sum is σ = 115143224514. Its totient is φ = 115143224512.
The previous prime is 115143224491. The next prime is 115143224681. The reversal of 115143224513 is 315422341511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 65542144144 + 49601080369 = 256012^2 + 222713^2 .
It is a cyclic number.
It is not a de Polignac number, because 115143224513 - 212 = 115143220417 is a prime.
It is a super-2 number, since 2×1151432245132 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 115143224513.
It is not a weakly prime, because it can be changed into another prime (115143224113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57571612256 + 57571612257.
It is an arithmetic number, because the mean of its divisors is an integer number (57571612257).
Almost surely, 2115143224513 is an apocalyptic number.
It is an amenable number.
115143224513 is a deficient number, since it is larger than the sum of its proper divisors (1).
115143224513 is an equidigital number, since it uses as much as digits as its factorization.
115143224513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14400, while the sum is 32.
The spelling of 115143224513 in words is "one hundred fifteen billion, one hundred forty-three million, two hundred twenty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •