Base | Representation |
---|---|
bin | 110100101000010001… |
… | …0010001011001011101 |
3 | 101210201120122200100101 |
4 | 1221100202101121131 |
5 | 3322431144424013 |
6 | 123530521301101 |
7 | 11110514536162 |
oct | 1512042213135 |
9 | 353646580311 |
10 | 113020311133 |
11 | 43a28023614 |
12 | 19aa2334791 |
13 | a872173362 |
14 | 5682396069 |
15 | 2e1734e8dd |
hex | 1a5089165d |
113020311133 has 4 divisors (see below), whose sum is σ = 117934237728. Its totient is φ = 108106384540.
The previous prime is 113020311127. The next prime is 113020311143. The reversal of 113020311133 is 331113020311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 113020311133 - 229 = 112483440221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113020311133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113020311143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2456963263 + ... + 2456963308.
It is an arithmetic number, because the mean of its divisors is an integer number (29483559432).
Almost surely, 2113020311133 is an apocalyptic number.
It is an amenable number.
113020311133 is a deficient number, since it is larger than the sum of its proper divisors (4913926595).
113020311133 is an equidigital number, since it uses as much as digits as its factorization.
113020311133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4913926594.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 113020311133 its reverse (331113020311), we get a palindrome (444133331444).
The spelling of 113020311133 in words is "one hundred thirteen billion, twenty million, three hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •