Base | Representation |
---|---|
bin | 110101101010110000… |
… | …0001101011000101111 |
3 | 102000111001100112110001 |
4 | 1223111200031120233 |
5 | 3342013242441033 |
6 | 124540131525131 |
7 | 11220013345636 |
oct | 1532540153057 |
9 | 360431315401 |
10 | 115251140143 |
11 | 4497229a457 |
12 | 1a4054597a7 |
13 | ab393aa119 |
14 | 581477a51d |
15 | 2ee810ae7d |
hex | 1ad580d62f |
115251140143 has 4 divisors (see below), whose sum is σ = 115485868008. Its totient is φ = 115016412280.
The previous prime is 115251140141. The next prime is 115251140149. The reversal of 115251140143 is 341041152511.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 115251140143 - 21 = 115251140141 is a prime.
It is a super-2 number, since 2×1152511401432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115251140141) 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 in 3 ways as a sum of consecutive naturals, for example, 117363196 + ... + 117364177.
It is an arithmetic number, because the mean of its divisors is an integer number (28871467002).
Almost surely, 2115251140143 is an apocalyptic number.
115251140143 is a deficient number, since it is larger than the sum of its proper divisors (234727865).
115251140143 is an equidigital number, since it uses as much as digits as its factorization.
115251140143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234727864.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 115251140143 its reverse (341041152511), we get a palindrome (456292292654).
The spelling of 115251140143 in words is "one hundred fifteen billion, two hundred fifty-one million, one hundred forty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •