Base | Representation |
---|---|
bin | 110100101101101011… |
… | …1100001000011000111 |
3 | 101211012020121111220100 |
4 | 1221123113201003013 |
5 | 3323314210303111 |
6 | 124000532335143 |
7 | 11115152321022 |
oct | 1513327410307 |
9 | 354166544810 |
10 | 113202041031 |
11 | 44010667a12 |
12 | 19b331744b3 |
13 | a8a0a01741 |
14 | 569c5801b9 |
15 | 2e2829a756 |
hex | 1a5b5e10c7 |
113202041031 has 24 divisors (see below), whose sum is σ = 167795868240. Its totient is φ = 73498262400.
The previous prime is 113202041003. The next prime is 113202041039. The reversal of 113202041031 is 130140202311.
It is not a de Polignac number, because 113202041031 - 230 = 112128299207 is a prime.
It is a super-2 number, since 2×1132020410312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113202040995 and 113202041013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113202041039) 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 23 ways as a sum of consecutive naturals, for example, 57936 + ... + 479333.
It is an arithmetic number, because the mean of its divisors is an integer number (6991494510).
Almost surely, 2113202041031 is an apocalyptic number.
113202041031 is a deficient number, since it is larger than the sum of its proper divisors (54593827209).
113202041031 is a wasteful number, since it uses less digits than its factorization.
113202041031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537887 (or 537884 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 113202041031 its reverse (130140202311), we get a palindrome (243342243342).
The spelling of 113202041031 in words is "one hundred thirteen billion, two hundred two million, forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •