Base | Representation |
---|---|
bin | 110100010000101111… |
… | …1010111011010111101 |
3 | 101201200120110112202122 |
4 | 1220201133113122331 |
5 | 3314322120121341 |
6 | 123320324132325 |
7 | 11052121634405 |
oct | 1504137273275 |
9 | 351616415678 |
10 | 112231020221 |
11 | 43662537681 |
12 | 19901b370a5 |
13 | a77779ca08 |
14 | 5609617805 |
15 | 2dbcde094b |
hex | 1a217d76bd |
112231020221 has 6 divisors (see below), whose sum is σ = 115968162366. Its totient is φ = 108610663800.
The previous prime is 112231020217. The next prime is 112231020241. The reversal of 112231020221 is 122020132211.
It can be written as a sum of positive squares in only one way, i.e., 112194852025 + 36168196 = 334955^2 + 6014^2 .
It is not a de Polignac number, because 112231020221 - 22 = 112231020217 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 112231020221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112231020241) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 58391870 + ... + 58393791.
It is an arithmetic number, because the mean of its divisors is an integer number (19328027061).
Almost surely, 2112231020221 is an apocalyptic number.
It is an amenable number.
112231020221 is a deficient number, since it is larger than the sum of its proper divisors (3737142145).
112231020221 is an equidigital number, since it uses as much as digits as its factorization.
112231020221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116785723 (or 116785692 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 112231020221 its reverse (122020132211), we get a palindrome (234251152432).
The spelling of 112231020221 in words is "one hundred twelve billion, two hundred thirty-one million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •