Base | Representation |
---|---|
bin | 10000001100101011001… |
… | …100111001010000110111 |
3 | 10221102011100011101222111 |
4 | 100030223030321100313 |
5 | 121214133030031411 |
6 | 2211205541111451 |
7 | 143264120123431 |
oct | 20145314712067 |
9 | 3842140141874 |
10 | 1113121330231 |
11 | 39a087a76669 |
12 | 15b8920b8587 |
13 | 80c7534b4c1 |
14 | 3bc37db7651 |
15 | 1de4c8bc721 |
hex | 1032b339437 |
1113121330231 has 2 divisors, whose sum is σ = 1113121330232. Its totient is φ = 1113121330230.
The previous prime is 1113121330201. The next prime is 1113121330241. The reversal of 1113121330231 is 1320331213111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1113121330231 - 229 = 1112584459319 is a prime.
It is a super-2 number, since 2×11131213302312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1113121330201) 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 as a sum of consecutive naturals, namely, 556560665115 + 556560665116.
It is an arithmetic number, because the mean of its divisors is an integer number (556560665116).
Almost surely, 21113121330231 is an apocalyptic number.
1113121330231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113121330231 is an equidigital number, since it uses as much as digits as its factorization.
1113121330231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 1113121330231 its reverse (1320331213111), we get a palindrome (2433452543342).
The spelling of 1113121330231 in words is "one trillion, one hundred thirteen billion, one hundred twenty-one million, three hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •