Base | Representation |
---|---|
bin | 110100110001010011… |
… | …0001100100111101111 |
3 | 101211111200211122010112 |
4 | 1221202212030213233 |
5 | 3324041233030111 |
6 | 124020544130235 |
7 | 11121154261202 |
oct | 1514246144757 |
9 | 354450748115 |
10 | 113323330031 |
11 | 4407307a15a |
12 | 19b6790697b |
13 | a8bcb8a292 |
14 | 56b0713939 |
15 | 2e33c57e8b |
hex | 1a6298c9ef |
113323330031 has 4 divisors (see below), whose sum is σ = 113436995352. Its totient is φ = 113209664712.
The previous prime is 113323329971. The next prime is 113323330037. The reversal of 113323330031 is 130033323311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113323330031 is a prime.
It is a super-2 number, since 2×1133233300312 (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 = 113323329979 and 113323330006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113323330037) 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, 56831165 + ... + 56833158.
It is an arithmetic number, because the mean of its divisors is an integer number (28359248838).
Almost surely, 2113323330031 is an apocalyptic number.
113323330031 is a deficient number, since it is larger than the sum of its proper divisors (113665321).
113323330031 is an equidigital number, since it uses as much as digits as its factorization.
113323330031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113665320.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 113323330031 its reverse (130033323311), we get a palindrome (243356653342).
The spelling of 113323330031 in words is "one hundred thirteen billion, three hundred twenty-three million, three hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •