Base | Representation |
---|---|
bin | 110100001110000010… |
… | …0111011001001000001 |
3 | 101201110020120112100121 |
4 | 1220130010323021001 |
5 | 3314130342440221 |
6 | 123303321420241 |
7 | 11046636665032 |
oct | 1503404731101 |
9 | 351406515317 |
10 | 112140202561 |
11 | 43616247a62 |
12 | 1989763a681 |
13 | a761a2285a |
14 | 55db536a89 |
15 | 2db4e51a41 |
hex | 1a1c13b241 |
112140202561 has 4 divisors (see below), whose sum is σ = 112175151300. Its totient is φ = 112105253824.
The previous prime is 112140202553. The next prime is 112140202637. The reversal of 112140202561 is 165202041211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 59173481536 + 52966721025 = 243256^2 + 230145^2 .
It is a cyclic number.
It is not a de Polignac number, because 112140202561 - 23 = 112140202553 is a prime.
It is a super-2 number, since 2×1121402025612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112140202061) 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, 17469556 + ... + 17475973.
It is an arithmetic number, because the mean of its divisors is an integer number (28043787825).
Almost surely, 2112140202561 is an apocalyptic number.
It is an amenable number.
112140202561 is a deficient number, since it is larger than the sum of its proper divisors (34948739).
112140202561 is an equidigital number, since it uses as much as digits as its factorization.
112140202561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34948738.
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 112140202561 its reverse (165202041211), we get a palindrome (277342243772).
The spelling of 112140202561 in words is "one hundred twelve billion, one hundred forty million, two hundred two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •