Base | Representation |
---|---|
bin | 10000001011111011100… |
… | …100110111111110001111 |
3 | 10221100002122122222022202 |
4 | 100023323210313332033 |
5 | 121211014002410111 |
6 | 2210554355232115 |
7 | 143235245430452 |
oct | 20137344677617 |
9 | 3840078588282 |
10 | 1112322310031 |
11 | 399807a44999 |
12 | 15b6aa5a863b |
13 | 80b7894c59a |
14 | 3bb9dc25499 |
15 | 1de0268ab3b |
hex | 102fb937f8f |
1112322310031 has 16 divisors (see below), whose sum is σ = 1133459136000. Its totient is φ = 1091263945728.
The previous prime is 1112322310007. The next prime is 1112322310037. The reversal of 1112322310031 is 1300132232111.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1112322310031 is a prime.
It is a super-2 number, since 2×11123223100312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1112322309985 and 1112322310012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112322310037) 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, 61618895 + ... + 61636943.
It is an arithmetic number, because the mean of its divisors is an integer number (70841196000).
Almost surely, 21112322310031 is an apocalyptic number.
1112322310031 is a deficient number, since it is larger than the sum of its proper divisors (21136825969).
1112322310031 is a wasteful number, since it uses less digits than its factorization.
1112322310031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20158.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1112322310031 its reverse (1300132232111), we get a palindrome (2412454542142).
The spelling of 1112322310031 in words is "one trillion, one hundred twelve billion, three hundred twenty-two million, three hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •