Base | Representation |
---|---|
bin | 11001011111010011001000… |
… | …000001010001011001011001 |
3 | 112200220211212021112101101221 |
4 | 121133103020001101121121 |
5 | 104143134400030432301 |
6 | 1034230540542012041 |
7 | 32420050055446414 |
oct | 3137231001213131 |
9 | 480824767471357 |
10 | 112102002202201 |
11 | 327a0212828240 |
12 | 106a6151877021 |
13 | 4a722340b0a9b |
14 | 1d97aa1720b7b |
15 | ce606c5c4da1 |
hex | 65f4c8051659 |
112102002202201 has 16 divisors (see below), whose sum is σ = 122674546656000. Its totient is φ = 101593428947920.
The previous prime is 112102002202171. The next prime is 112102002202207. The reversal of 112102002202201 is 102202200201211.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112102002202201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112102002202207) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4222951 + ... + 15557548.
It is an arithmetic number, because the mean of its divisors is an integer number (7667159166000).
Almost surely, 2112102002202201 is an apocalyptic number.
112102002202201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112102002202201 is a deficient number, since it is larger than the sum of its proper divisors (10572544453799).
112102002202201 is a wasteful number, since it uses less digits than its factorization.
112102002202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19782116.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 112102002202201 its reverse (102202200201211), we get a palindrome (214304202403412).
The spelling of 112102002202201 in words is "one hundred twelve trillion, one hundred two billion, two million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •