Base | Representation |
---|---|
bin | 110100101011010011… |
… | …1011100011011011101 |
3 | 101210222200121210101021 |
4 | 1221112213130123131 |
5 | 3323133304032313 |
6 | 123545004044141 |
7 | 11113163641225 |
oct | 1512647343335 |
9 | 353880553337 |
10 | 113122330333 |
11 | 43a7a674101 |
12 | 19b10533651 |
13 | a88a342c4c |
14 | 5691b51085 |
15 | 2e212a278d |
hex | 1a569dc6dd |
113122330333 has 4 divisors (see below), whose sum is σ = 113135768928. Its totient is φ = 113108891740.
The previous prime is 113122330331. The next prime is 113122330411. The reversal of 113122330333 is 333033221311.
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 113122330333 - 21 = 113122330331 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113122330298 and 113122330307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113122330331) 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, 6706663 + ... + 6723508.
It is an arithmetic number, because the mean of its divisors is an integer number (28283942232).
Almost surely, 2113122330333 is an apocalyptic number.
It is an amenable number.
113122330333 is a deficient number, since it is larger than the sum of its proper divisors (13438595).
113122330333 is an equidigital number, since it uses as much as digits as its factorization.
113122330333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13438594.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 113122330333 its reverse (333033221311), we get a palindrome (446155551644).
The spelling of 113122330333 in words is "one hundred thirteen billion, one hundred twenty-two million, three hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •