Base | Representation |
---|---|
bin | 110101110000001100… |
… | …1111110000111111111 |
3 | 102000221210112112021122 |
4 | 1223200121332013333 |
5 | 3342402104213033 |
6 | 125010224221155 |
7 | 11224364161622 |
oct | 1534031760777 |
9 | 360853475248 |
10 | 115434054143 |
11 | 44a56572451 |
12 | 1a45676a7bb |
13 | ab68261465 |
14 | 5830b91db9 |
15 | 30091dca98 |
hex | 1ae067e1ff |
115434054143 has 4 divisors (see below), whose sum is σ = 122224292640. Its totient is φ = 108643815648.
The previous prime is 115434054139. The next prime is 115434054163. The reversal of 115434054143 is 341450434511.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341450434511 = 1543 ⋅221289977.
It is a cyclic number.
It is not a de Polignac number, because 115434054143 - 22 = 115434054139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115434054163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3395119223 + ... + 3395119256.
It is an arithmetic number, because the mean of its divisors is an integer number (30556073160).
Almost surely, 2115434054143 is an apocalyptic number.
115434054143 is a deficient number, since it is larger than the sum of its proper divisors (6790238497).
115434054143 is an equidigital number, since it uses as much as digits as its factorization.
115434054143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6790238496.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 115434054143 its reverse (341450434511), we get a palindrome (456884488654).
The spelling of 115434054143 in words is "one hundred fifteen billion, four hundred thirty-four million, fifty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •