Base | Representation |
---|---|
bin | 11001101111111010001001… |
… | …010000000011001000000001 |
3 | 112211221222000222110011100212 |
4 | 121233322021100003020001 |
5 | 104320340001031141113 |
6 | 1040503145441123505 |
7 | 32565365164242656 |
oct | 3157721120031001 |
9 | 484858028404325 |
10 | 113243410412033 |
11 | 330a0295a23150 |
12 | 1084b3b9029595 |
13 | 4b25a66902b65 |
14 | 1dd7020403c2d |
15 | d15ac34c50a8 |
hex | 66fe89403201 |
113243410412033 has 16 divisors (see below), whose sum is σ = 124697858584896. Its totient is φ = 101982305303040.
The previous prime is 113243410412023. The next prime is 113243410412053. The reversal of 113243410412033 is 330214014342311.
It is a cyclic number.
It is not a de Polignac number, because 113243410412033 - 212 = 113243410407937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113243410412023) 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 15 ways as a sum of consecutive naturals, for example, 27441785 + ... + 31297577.
It is an arithmetic number, because the mean of its divisors is an integer number (7793616161556).
Almost surely, 2113243410412033 is an apocalyptic number.
It is an amenable number.
113243410412033 is a deficient number, since it is larger than the sum of its proper divisors (11454448172863).
113243410412033 is a wasteful number, since it uses less digits than its factorization.
113243410412033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3880864.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 113243410412033 its reverse (330214014342311), we get a palindrome (443457424754344).
The spelling of 113243410412033 in words is "one hundred thirteen trillion, two hundred forty-three billion, four hundred ten million, four hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •