Base | Representation |
---|---|
bin | 110100101010111110… |
… | …1011111010101101001 |
3 | 101210221220221000210001 |
4 | 1221111331133111221 |
5 | 3323123000112301 |
6 | 123543532223001 |
7 | 11113001313550 |
oct | 1512575372551 |
9 | 353856830701 |
10 | 113111332201 |
11 | 43a7444203a |
12 | 19b0890aa61 |
13 | a887c91c8a |
14 | 56904cad97 |
15 | 2e2032dc01 |
hex | 1a55f5f569 |
113111332201 has 8 divisors (see below), whose sum is σ = 129272231744. Its totient is φ = 96950967120.
The previous prime is 113111332199. The next prime is 113111332219. The reversal of 113111332201 is 102233111311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113111332201 - 21 = 113111332199 is a prime.
It is a super-3 number, since 3×1131113322013 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113111332231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 559846 + ... + 734608.
It is an arithmetic number, because the mean of its divisors is an integer number (16159028968).
Almost surely, 2113111332201 is an apocalyptic number.
It is an amenable number.
113111332201 is a deficient number, since it is larger than the sum of its proper divisors (16160899543).
113111332201 is an equidigital number, since it uses as much as digits as its factorization.
113111332201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267231.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 113111332201 its reverse (102233111311), we get a palindrome (215344443512).
The spelling of 113111332201 in words is "one hundred thirteen billion, one hundred eleven million, three hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •