Base | Representation |
---|---|
bin | 110100110000101100… |
… | …1000100011000110101 |
3 | 101211110021210102010201 |
4 | 1221201121010120311 |
5 | 3324021044024341 |
6 | 124014542520501 |
7 | 11120520361216 |
oct | 1514131043065 |
9 | 354407712121 |
10 | 113303111221 |
11 | 4406271a4a3 |
12 | 19b60b96131 |
13 | a8b892b3a1 |
14 | 56abb6d40d |
15 | 2e320b2331 |
hex | 1a61644635 |
113303111221 has 4 divisors (see below), whose sum is σ = 118229333472. Its totient is φ = 108376888972.
The previous prime is 113303111191. The next prime is 113303111227. The reversal of 113303111221 is 122111303311.
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 113303111221 - 215 = 113303078453 is a prime.
It is a super-2 number, since 2×1133031112212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113303111227) 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, 2463111091 + ... + 2463111136.
It is an arithmetic number, because the mean of its divisors is an integer number (29557333368).
Almost surely, 2113303111221 is an apocalyptic number.
It is an amenable number.
113303111221 is a deficient number, since it is larger than the sum of its proper divisors (4926222251).
113303111221 is an equidigital number, since it uses as much as digits as its factorization.
113303111221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4926222250.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 113303111221 its reverse (122111303311), we get a palindrome (235414414532).
The spelling of 113303111221 in words is "one hundred thirteen billion, three hundred three million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •