Base | Representation |
---|---|
bin | 110100001101001110… |
… | …1001010101011010101 |
3 | 101201101100101122212122 |
4 | 1220122131022223111 |
5 | 3314101412100341 |
6 | 123300510425325 |
7 | 11046156542462 |
oct | 1503235125325 |
9 | 351340348778 |
10 | 112113003221 |
11 | 4360195a76a |
12 | 1988a502245 |
13 | a7591bb57b |
14 | 55d7a96669 |
15 | 2db287c94b |
hex | 1a1a74aad5 |
112113003221 has 8 divisors (see below), whose sum is σ = 115851788544. Its totient is φ = 108381857760.
The previous prime is 112113003173. The next prime is 112113003259. The reversal of 112113003221 is 122300311211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-112113003221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112113003221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112113003271) 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, 1880120 + ... + 1938833.
It is an arithmetic number, because the mean of its divisors is an integer number (14481473568).
Almost surely, 2112113003221 is an apocalyptic number.
It is an amenable number.
112113003221 is a deficient number, since it is larger than the sum of its proper divisors (3738785323).
112113003221 is an equidigital number, since it uses as much as digits as its factorization.
112113003221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3819931.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 112113003221 its reverse (122300311211), we get a palindrome (234413314432).
The spelling of 112113003221 in words is "one hundred twelve billion, one hundred thirteen million, three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •