Base | Representation |
---|---|
bin | 11001011111010011010101… |
… | …000001000100101100011111 |
3 | 112200220212102110211120012212 |
4 | 121133103111001010230133 |
5 | 104143140321341111413 |
6 | 1034231014331351035 |
7 | 32420055344040041 |
oct | 3137232501045437 |
9 | 480825373746185 |
10 | 112102220253983 |
11 | 327a031491a823 |
12 | 106a61b28b247b |
13 | 4a7226a3187cb |
14 | 1d97ac2681a91 |
15 | ce60817e7ca8 |
hex | 65f4d5044b1f |
112102220253983 has 4 divisors (see below), whose sum is σ = 112357578387120. Its totient is φ = 111846862120848.
The previous prime is 112102220253967. The next prime is 112102220253997. The reversal of 112102220253983 is 389352022201211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112102220253983 - 24 = 112102220253967 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 112102220253983.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112102225253983) 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, 127679065910 + ... + 127679066787.
It is an arithmetic number, because the mean of its divisors is an integer number (28089394596780).
Almost surely, 2112102220253983 is an apocalyptic number.
112102220253983 is a deficient number, since it is larger than the sum of its proper divisors (255358133137).
112102220253983 is an equidigital number, since it uses as much as digits as its factorization.
112102220253983 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 255358133136.
The product of its (nonzero) digits is 103680, while the sum is 41.
The spelling of 112102220253983 in words is "one hundred twelve trillion, one hundred two billion, two hundred twenty million, two hundred fifty-three thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •