Base | Representation |
---|---|
bin | 11010001010001100101101… |
… | …010111101001100010101111 |
3 | 120002100200021210211001112011 |
4 | 122022030231113221202233 |
5 | 110034440000313212033 |
6 | 1044405132520222051 |
7 | 33143043331422430 |
oct | 3212145527514257 |
9 | 502320253731464 |
10 | 115050050132143 |
11 | 337274a7a50825 |
12 | 10aa157900a927 |
13 | 4c27233608a19 |
14 | 205a648947487 |
15 | d47ab0dccccd |
hex | 68a32d5e98af |
115050050132143 has 8 divisors (see below), whose sum is σ = 131490027993888. Its totient is φ = 98611136373984.
The previous prime is 115050050132131. The next prime is 115050050132183. The reversal of 115050050132143 is 341231050050511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 115050050132143 - 221 = 115050048034991 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 (115050050132183) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 265794196 + ... + 266226697.
It is an arithmetic number, because the mean of its divisors is an integer number (16436253499236).
Almost surely, 2115050050132143 is an apocalyptic number.
115050050132143 is a deficient number, since it is larger than the sum of its proper divisors (16439977861745).
115050050132143 is an equidigital number, since it uses as much as digits as its factorization.
115050050132143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532051793.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 115050050132143 in words is "one hundred fifteen trillion, fifty billion, fifty million, one hundred thirty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •