Base | Representation |
---|---|
bin | 110100010000100100… |
… | …1000001100011101101 |
3 | 101201200011102222212002 |
4 | 1220201021001203231 |
5 | 3314314120213001 |
6 | 123315554422045 |
7 | 11052021102413 |
oct | 1504111014355 |
9 | 351604388762 |
10 | 112225163501 |
11 | 4365a1a7410 |
12 | 198bbb91925 |
13 | a7764cbcb9 |
14 | 56089312b3 |
15 | 2dbc63546b |
hex | 1a212418ed |
112225163501 has 4 divisors (see below), whose sum is σ = 122427451104. Its totient is φ = 102022875900.
The previous prime is 112225163473. The next prime is 112225163527. The reversal of 112225163501 is 105361522211.
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 not a de Polignac number, because 112225163501 - 26 = 112225163437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112225163591) 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, 5101143785 + ... + 5101143806.
It is an arithmetic number, because the mean of its divisors is an integer number (30606862776).
Almost surely, 2112225163501 is an apocalyptic number.
112225163501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112225163501 is a deficient number, since it is larger than the sum of its proper divisors (10202287603).
112225163501 is a wasteful number, since it uses less digits than its factorization.
112225163501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10202287602.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 112225163501 its reverse (105361522211), we get a palindrome (217586685712).
The spelling of 112225163501 in words is "one hundred twelve billion, two hundred twenty-five million, one hundred sixty-three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •