Base | Representation |
---|---|
bin | 11001011111010010011110… |
… | …001011000101100101111111 |
3 | 112200220210001100110112110011 |
4 | 121133102132023011211333 |
5 | 104143131430313212343 |
6 | 1034230343142124051 |
7 | 32420023502114233 |
oct | 3137223613054577 |
9 | 480823040415404 |
10 | 112101300132223 |
11 | 3279a9924a4716 |
12 | 106a5b96720627 |
13 | 4a721517c846c |
14 | 1d97a363a85c3 |
15 | ce602ab4429d |
hex | 65f49e2c597f |
112101300132223 has 16 divisors (see below), whose sum is σ = 113177385611136. Its totient is φ = 111030565177440.
The previous prime is 112101300132221. The next prime is 112101300132229. The reversal of 112101300132223 is 322231003101211.
It is a cyclic number.
It is not a de Polignac number, because 112101300132223 - 21 = 112101300132221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112101300132194 and 112101300132203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112101300132221) 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, 58189740 + ... + 60085342.
It is an arithmetic number, because the mean of its divisors is an integer number (7073586600696).
Almost surely, 2112101300132223 is an apocalyptic number.
112101300132223 is a deficient number, since it is larger than the sum of its proper divisors (1076085478913).
112101300132223 is a wasteful number, since it uses less digits than its factorization.
112101300132223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1897014.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 112101300132223 its reverse (322231003101211), we get a palindrome (434332303233434).
The spelling of 112101300132223 in words is "one hundred twelve trillion, one hundred one billion, three hundred million, one hundred thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •