Base | Representation |
---|---|
bin | 110100101110100101… |
… | …1000011111001011011 |
3 | 101211021100121101000021 |
4 | 1221131023003321123 |
5 | 3323344434032311 |
6 | 124003533451311 |
7 | 11116000633021 |
oct | 1513513037133 |
9 | 354240541007 |
10 | 113232330331 |
11 | 4402677579a |
12 | 19b41340b37 |
13 | a8a70782c3 |
14 | 56a25c6711 |
15 | 2e2ac80171 |
hex | 1a5d2c3e5b |
113232330331 has 4 divisors (see below), whose sum is σ = 118155475152. Its totient is φ = 108309185512.
The previous prime is 113232330319. The next prime is 113232330347. The reversal of 113232330331 is 133033232311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113232330331 - 231 = 111084846683 is a prime.
It is a super-2 number, since 2×1132323303312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113232330296 and 113232330305.
It is not an unprimeable number, because it can be changed into a prime (113232330031) 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, 2461572376 + ... + 2461572421.
It is an arithmetic number, because the mean of its divisors is an integer number (29538868788).
Almost surely, 2113232330331 is an apocalyptic number.
113232330331 is a deficient number, since it is larger than the sum of its proper divisors (4923144821).
113232330331 is an equidigital number, since it uses as much as digits as its factorization.
113232330331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4923144820.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 113232330331 its reverse (133033232311), we get a palindrome (246265562642).
The spelling of 113232330331 in words is "one hundred thirteen billion, two hundred thirty-two million, three hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •