Base | Representation |
---|---|
bin | 110100101110001110… |
… | …0001001001001111101 |
3 | 101211020111110111122020 |
4 | 1221130130021021331 |
5 | 3323333311443401 |
6 | 124002414110353 |
7 | 11115461246142 |
oct | 1513434111175 |
9 | 354214414566 |
10 | 113220031101 |
11 | 4401a835141 |
12 | 19b391ab3b9 |
13 | a8a4660058 |
14 | 56a0b043c9 |
15 | 2e29b50d36 |
hex | 1a5c70927d |
113220031101 has 8 divisors (see below), whose sum is σ = 150961715424. Its totient is φ = 75479183760.
The previous prime is 113220031091. The next prime is 113220031153. The reversal of 113220031101 is 101130022311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113220031101 - 26 = 113220031037 is a prime.
It is a super-2 number, since 2×1132200311012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113220731101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 251031 + ... + 538011.
It is an arithmetic number, because the mean of its divisors is an integer number (18870214428).
Almost surely, 2113220031101 is an apocalyptic number.
It is an amenable number.
113220031101 is a deficient number, since it is larger than the sum of its proper divisors (37741684323).
113220031101 is a wasteful number, since it uses less digits than its factorization.
113220031101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418491.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 113220031101 its reverse (101130022311), we get a palindrome (214350053412).
The spelling of 113220031101 in words is "one hundred thirteen billion, two hundred twenty million, thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •