Base | Representation |
---|---|
bin | 11010001110100100011011… |
… | …111010101011010101010001 |
3 | 120010102101120001120000221022 |
4 | 122032210123322223111101 |
5 | 110104400112142112340 |
6 | 1045155124452205225 |
7 | 33203535366113234 |
oct | 3216443372532521 |
9 | 503371501500838 |
10 | 115350405035345 |
11 | 33832917511057 |
12 | 10b2b821309815 |
13 | 4c4965bb1950c |
14 | 206adbcc7141b |
15 | d507de7e33b5 |
hex | 68e91beab551 |
115350405035345 has 8 divisors (see below), whose sum is σ = 138573099593664. Its totient is φ = 92178581660784.
The previous prime is 115350405035303. The next prime is 115350405035413. The reversal of 115350405035345 is 543530504053511.
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 115350405035345 - 210 = 115350405034321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115350405035296 and 115350405035305.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12717790949 + ... + 12717800018.
It is an arithmetic number, because the mean of its divisors is an integer number (17321637449208).
Almost surely, 2115350405035345 is an apocalyptic number.
It is an amenable number.
115350405035345 is a deficient number, since it is larger than the sum of its proper divisors (23222694558319).
115350405035345 is an equidigital number, since it uses as much as digits as its factorization.
115350405035345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25435591879.
The product of its (nonzero) digits is 1350000, while the sum is 44.
Adding to 115350405035345 its reverse (543530504053511), we get a palindrome (658880909088856).
The spelling of 115350405035345 in words is "one hundred fifteen trillion, three hundred fifty billion, four hundred five million, thirty-five thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •