Base | Representation |
---|---|
bin | 1101011000000… |
… | …01101100111001 |
3 | 21211010120202222 |
4 | 12230001230321 |
5 | 212211021401 |
6 | 15044533425 |
7 | 2531503055 |
oct | 654015471 |
9 | 254116688 |
10 | 112204601 |
11 | 58377a83 |
12 | 316b1275 |
13 | 1a327972 |
14 | 10c8ac65 |
15 | 9cb5c1b |
hex | 6b01b39 |
112204601 has 2 divisors, whose sum is σ = 112204602. Its totient is φ = 112204600.
The previous prime is 112204597. The next prime is 112204619. The reversal of 112204601 is 106402211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82828201 + 29376400 = 9101^2 + 5420^2 .
It is an emirp because it is prime and its reverse (106402211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112204601 - 22 = 112204597 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112204601.
It is not a weakly prime, because it can be changed into another prime (112204621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56102300 + 56102301.
It is an arithmetic number, because the mean of its divisors is an integer number (56102301).
Almost surely, 2112204601 is an apocalyptic number.
It is an amenable number.
112204601 is a deficient number, since it is larger than the sum of its proper divisors (1).
112204601 is an equidigital number, since it uses as much as digits as its factorization.
112204601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 112204601 is about 10592.6673222565. The cubic root of 112204601 is about 482.3217966130.
Adding to 112204601 its reverse (106402211), we get a palindrome (218606812).
The spelling of 112204601 in words is "one hundred twelve million, two hundred four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •