Base | Representation |
---|---|
bin | 10000001011110110000… |
… | …101111101101101110101 |
3 | 10221022212020120110010002 |
4 | 100023312011331231311 |
5 | 121210321430233023 |
6 | 2210541311441045 |
7 | 143233050512060 |
oct | 20136605755565 |
9 | 3838766513102 |
10 | 1112230321013 |
11 | 399770025209 |
12 | 15b683826185 |
13 | 80b62882206 |
14 | 3bb9191b8d7 |
15 | 1dde9569b28 |
hex | 102f617db75 |
1112230321013 has 16 divisors (see below), whose sum is σ = 1276647450624. Its totient is φ = 949201888560.
The previous prime is 1112230320961. The next prime is 1112230321063. The reversal of 1112230321013 is 3101230322111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1112230321013 - 28 = 1112230320757 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112230321063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1643006 + ... + 2218992.
It is an arithmetic number, because the mean of its divisors is an integer number (79790465664).
Almost surely, 21112230321013 is an apocalyptic number.
It is an amenable number.
1112230321013 is a deficient number, since it is larger than the sum of its proper divisors (164417129611).
1112230321013 is an equidigital number, since it uses as much as digits as its factorization.
1112230321013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 577192.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1112230321013 its reverse (3101230322111), we get a palindrome (4213460643124).
The spelling of 1112230321013 in words is "one trillion, one hundred twelve billion, two hundred thirty million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •