Base | Representation |
---|---|
bin | 110100101011100110… |
… | …0110101101101110001 |
3 | 101211000101001211102122 |
4 | 1221113030311231301 |
5 | 3323143311230413 |
6 | 123545554124025 |
7 | 11113343160140 |
oct | 1512714655561 |
9 | 354011054378 |
10 | 113132133233 |
11 | 43a8515a179 |
12 | 19b13880615 |
13 | a88c395b92 |
14 | 5693183757 |
15 | 2e2208c108 |
hex | 1a57335b71 |
113132133233 has 4 divisors (see below), whose sum is σ = 129293866560. Its totient is φ = 96970399908.
The previous prime is 113132133157. The next prime is 113132133241. The reversal of 113132133233 is 332331231311.
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, and also an emirpimes, since its reverse is a distinct semiprime: 332331231311 = 109 ⋅3048910379.
It is a cyclic number.
It is not a de Polignac number, because 113132133233 - 222 = 113127938929 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (113132133133) 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, 8080866653 + ... + 8080866666.
It is an arithmetic number, because the mean of its divisors is an integer number (32323466640).
Almost surely, 2113132133233 is an apocalyptic number.
It is an amenable number.
113132133233 is a deficient number, since it is larger than the sum of its proper divisors (16161733327).
113132133233 is an equidigital number, since it uses as much as digits as its factorization.
113132133233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16161733326.
The product of its digits is 2916, while the sum is 26.
Adding to 113132133233 its reverse (332331231311), we get a palindrome (445463364544).
The spelling of 113132133233 in words is "one hundred thirteen billion, one hundred thirty-two million, one hundred thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •