Base | Representation |
---|---|
bin | 10000001011101110100… |
… | …000110001100001011111 |
3 | 10221022112101020112112102 |
4 | 100023232200301201133 |
5 | 121210041400144411 |
6 | 2210520525355315 |
7 | 143226644434301 |
oct | 20135640614137 |
9 | 3838471215472 |
10 | 1112103131231 |
11 | 399705252694 |
12 | 15b649108b3b |
13 | 80b4240b8a1 |
14 | 3bb7ca8d971 |
15 | 1dddd2e3d3b |
hex | 102ee83185f |
1112103131231 has 16 divisors (see below), whose sum is σ = 1198692633600. Its totient is φ = 1028353511808.
The previous prime is 1112103131197. The next prime is 1112103131327. The reversal of 1112103131231 is 1321313012111.
It is a cyclic number.
It is not a de Polignac number, because 1112103131231 - 238 = 837225224287 is a prime.
It is a super-2 number, since 2×11121031312312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112103133231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 702695 + ... + 1648631.
It is an arithmetic number, because the mean of its divisors is an integer number (74918289600).
Almost surely, 21112103131231 is an apocalyptic number.
1112103131231 is a deficient number, since it is larger than the sum of its proper divisors (86589502369).
1112103131231 is a wasteful number, since it uses less digits than its factorization.
1112103131231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 947438.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 1112103131231 its reverse (1321313012111), we get a palindrome (2433416143342).
The spelling of 1112103131231 in words is "one trillion, one hundred twelve billion, one hundred three million, one hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •