Base | Representation |
---|---|
bin | 11010001100011000110111… |
… | …011101101110100010101001 |
3 | 120002220001201221100210012220 |
4 | 122030120313131232202221 |
5 | 110044421203044244001 |
6 | 1045002222104224253 |
7 | 33156651566614401 |
oct | 3214306735564251 |
9 | 502801657323186 |
10 | 115200543353001 |
11 | 337853044a6017 |
12 | 10b06778a6b089 |
13 | 4c38498108732 |
14 | 2063a43a07801 |
15 | d4b96ce36c36 |
hex | 68c63776e8a9 |
115200543353001 has 4 divisors (see below), whose sum is σ = 153600724470672. Its totient is φ = 76800362235332.
The previous prime is 115200543352949. The next prime is 115200543353011. The reversal of 115200543353001 is 100353345002511.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115200543353001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (115200543353011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19200090558831 + ... + 19200090558836.
It is an arithmetic number, because the mean of its divisors is an integer number (38400181117668).
Almost surely, 2115200543353001 is an apocalyptic number.
It is an amenable number.
115200543353001 is a deficient number, since it is larger than the sum of its proper divisors (38400181117671).
115200543353001 is an equidigital number, since it uses as much as digits as its factorization.
115200543353001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38400181117670.
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 115200543353001 its reverse (100353345002511), we get a palindrome (215553888355512).
The spelling of 115200543353001 in words is "one hundred fifteen trillion, two hundred billion, five hundred forty-three million, three hundred fifty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •