Base | Representation |
---|---|
bin | 11001011111010001100100… |
… | …010110110100101100101111 |
3 | 112200220200112202020022212011 |
4 | 121133101210112310230233 |
5 | 104143122434003131343 |
6 | 1034230103011422051 |
7 | 32416660453203121 |
oct | 3137214426645457 |
9 | 480820482208764 |
10 | 112100330130223 |
11 | 3279a5349aa876 |
12 | 106a59658b4927 |
13 | 4a72028862396 |
14 | 1d97983629211 |
15 | ce5ec08db29d |
hex | 65f4645b4b2f |
112100330130223 has 2 divisors, whose sum is σ = 112100330130224. Its totient is φ = 112100330130222.
The previous prime is 112100330130167. The next prime is 112100330130227. The reversal of 112100330130223 is 322031033001211.
It is a strong prime.
It is an emirp because it is prime and its reverse (322031033001211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112100330130223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112100330130194 and 112100330130203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112100330130227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56050165065111 + 56050165065112.
It is an arithmetic number, because the mean of its divisors is an integer number (56050165065112).
Almost surely, 2112100330130223 is an apocalyptic number.
112100330130223 is a deficient number, since it is larger than the sum of its proper divisors (1).
112100330130223 is an equidigital number, since it uses as much as digits as its factorization.
112100330130223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 112100330130223 its reverse (322031033001211), we get a palindrome (434131363131434).
The spelling of 112100330130223 in words is "one hundred twelve trillion, one hundred billion, three hundred thirty million, one hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •