Base | Representation |
---|---|
bin | 11110000000100111001… |
… | …10111000010001100001 |
3 | 10122120111121021121210221 |
4 | 33000103212320101201 |
5 | 113343214001010423 |
6 | 2105405051523041 |
7 | 134332066552333 |
oct | 17002346702141 |
9 | 3576447247727 |
10 | 1031121110113 |
11 | 368328a92606 |
12 | 147a08459481 |
13 | 763079c30b3 |
14 | 37c99727453 |
15 | 1bc4d9e5e5d |
hex | f0139b8461 |
1031121110113 has 2 divisors, whose sum is σ = 1031121110114. Its totient is φ = 1031121110112.
The previous prime is 1031121110011. The next prime is 1031121110141. The reversal of 1031121110113 is 3110111211301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1026314877184 + 4806232929 = 1013072^2 + 69327^2 .
It is an emirp because it is prime and its reverse (3110111211301) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1031121110113 is a prime.
It is not a weakly prime, because it can be changed into another prime (1031121110713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515560555056 + 515560555057.
It is an arithmetic number, because the mean of its divisors is an integer number (515560555057).
Almost surely, 21031121110113 is an apocalyptic number.
It is an amenable number.
1031121110113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031121110113 is an equidigital number, since it uses as much as digits as its factorization.
1031121110113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 1031121110113 its reverse (3110111211301), we get a palindrome (4141232321414).
The spelling of 1031121110113 in words is "one trillion, thirty-one billion, one hundred twenty-one million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •