Base | Representation |
---|---|
bin | 110100101101101001… |
… | …0001101011110010101 |
3 | 101211012010222211221121 |
4 | 1221123102031132111 |
5 | 3323313331301013 |
6 | 124000442443541 |
7 | 11115134435644 |
oct | 1513322153625 |
9 | 354163884847 |
10 | 113200650133 |
11 | 4400a8a7a0a |
12 | 19b328035b1 |
13 | a8a063561c |
14 | 569c2db35b |
15 | 2e280c358d |
hex | 1a5b48d795 |
113200650133 has 4 divisors (see below), whose sum is σ = 115119305280. Its totient is φ = 111281994988.
The previous prime is 113200650127. The next prime is 113200650161. The reversal of 113200650133 is 331056002311.
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 a de Polignac number, because none of the positive numbers 2k-113200650133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113200650098 and 113200650107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113200650733) 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, 959327485 + ... + 959327602.
It is an arithmetic number, because the mean of its divisors is an integer number (28779826320).
Almost surely, 2113200650133 is an apocalyptic number.
It is an amenable number.
113200650133 is a deficient number, since it is larger than the sum of its proper divisors (1918655147).
113200650133 is an equidigital number, since it uses as much as digits as its factorization.
113200650133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1918655146.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 113200650133 its reverse (331056002311), we get a palindrome (444256652444).
The spelling of 113200650133 in words is "one hundred thirteen billion, two hundred million, six hundred fifty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •