Base | Representation |
---|---|
bin | 11001110100011010100001… |
… | …001111011100101100111001 |
3 | 112220001120021100000002122101 |
4 | 121310122201033130230321 |
5 | 104340423121420200040 |
6 | 1041301315024023401 |
7 | 32626636310102110 |
oct | 3164324117345471 |
9 | 486046240002571 |
10 | 113553050553145 |
11 | 331aa63a796115 |
12 | 1089b412a61b61 |
13 | 4b490119c3478 |
14 | 2007dd5992c77 |
15 | d1db9715c09a |
hex | 6746a13dcb39 |
113553050553145 has 32 divisors (see below), whose sum is σ = 160567947555840. Its totient is φ = 75473570128320.
The previous prime is 113553050553113. The next prime is 113553050553193. The reversal of 113553050553145 is 541355050355311.
It is not a de Polignac number, because 113553050553145 - 25 = 113553050553113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113553050553095 and 113553050553104.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 287781975 + ... + 288176284.
It is an arithmetic number, because the mean of its divisors is an integer number (5017748361120).
Almost surely, 2113553050553145 is an apocalyptic number.
It is an amenable number.
113553050553145 is a deficient number, since it is larger than the sum of its proper divisors (47014897002695).
113553050553145 is a wasteful number, since it uses less digits than its factorization.
113553050553145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 575958445.
The product of its (nonzero) digits is 1687500, while the sum is 46.
The spelling of 113553050553145 in words is "one hundred thirteen trillion, five hundred fifty-three billion, fifty million, five hundred fifty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •