Base | Representation |
---|---|
bin | 110100110001100011… |
… | …1010110110100001101 |
3 | 101211112022012021000100 |
4 | 1221203013112310031 |
5 | 3324100444210131 |
6 | 124021454321313 |
7 | 11121321203613 |
oct | 1514307266415 |
9 | 354468167010 |
10 | 113332022541 |
11 | 44077a76a51 |
12 | 19b6a7b9239 |
13 | a8c191198a |
14 | 56b19376b3 |
15 | 2e348c37e6 |
hex | 1a631d6d0d |
113332022541 has 6 divisors (see below), whose sum is σ = 163701810350. Its totient is φ = 75554681688.
The previous prime is 113332022539. The next prime is 113332022603. The reversal of 113332022541 is 145220233311.
113332022541 is a `hidden beast` number, since 113 + 3 + 3 + 2 + 0 + 2 + 2 + 541 = 666.
It can be written as a sum of positive squares in only one way, i.e., 76947986025 + 36384036516 = 277395^2 + 190746^2 .
It is not a de Polignac number, because 113332022541 - 21 = 113332022539 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 (113332022521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6296223466 + ... + 6296223483.
Almost surely, 2113332022541 is an apocalyptic number.
It is an amenable number.
113332022541 is a deficient number, since it is larger than the sum of its proper divisors (50369787809).
113332022541 is a wasteful number, since it uses less digits than its factorization.
113332022541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12592446955 (or 12592446952 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 113332022541 its reverse (145220233311), we get a palindrome (258552255852).
The spelling of 113332022541 in words is "one hundred thirteen billion, three hundred thirty-two million, twenty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •