Base | Representation |
---|---|
bin | 11001110100011100010110… |
… | …001010101100101011010100 |
3 | 112220001202100001021020001001 |
4 | 121310130112022230223110 |
5 | 104340441131113222012 |
6 | 1041302241421513044 |
7 | 32630036030142016 |
oct | 3164342612545324 |
9 | 486052301236031 |
10 | 113555012242132 |
11 | 3320045704608a |
12 | 1089b87ba12784 |
13 | 4b49265245996 |
14 | 20081403181b6 |
15 | d1dc5e4a3357 |
hex | 6747162acad4 |
113555012242132 has 12 divisors (see below), whose sum is σ = 199016548206196. Its totient is φ = 56693141326080.
The previous prime is 113555012242031. The next prime is 113555012242159. The reversal of 113555012242132 is 231242210555311.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 35594659447876 + 77960352794256 = 5966126^2 + 8829516^2 .
It is a junction number, because it is equal to n+sod(n) for n = 113555012242091 and 113555012242100.
It is a congruent number.
It is an unprimeable number.
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, 21091195719 + ... + 21091201102.
Almost surely, 2113555012242132 is an apocalyptic number.
It is an amenable number.
113555012242132 is a deficient number, since it is larger than the sum of its proper divisors (85461535964064).
113555012242132 is a wasteful number, since it uses less digits than its factorization.
113555012242132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42182397498 (or 42182397496 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 37.
Adding to 113555012242132 its reverse (231242210555311), we get a palindrome (344797222797443).
The spelling of 113555012242132 in words is "one hundred thirteen trillion, five hundred fifty-five billion, twelve million, two hundred forty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •