Base | Representation |
---|---|
bin | 11110000000101000011… |
… | …00100111010101001111 |
3 | 10122120112021220012012012 |
4 | 33000110030213111033 |
5 | 113343224014032231 |
6 | 2105410043531435 |
7 | 134332246622243 |
oct | 17002414472517 |
9 | 3576467805165 |
10 | 1031131002191 |
11 | 368333629684 |
12 | 147a0b829b7b |
13 | 76309a777b4 |
14 | 37c9ab80423 |
15 | 1bc4e7ebe2b |
hex | f01432754f |
1031131002191 has 2 divisors, whose sum is σ = 1031131002192. Its totient is φ = 1031131002190.
The previous prime is 1031131002157. The next prime is 1031131002257. The reversal of 1031131002191 is 1912001311301.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (1912001311301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1031131002191 - 234 = 1013951133007 is a prime.
It is a super-2 number, since 2×10311310021912 (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 (1031131202191) 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, 515565501095 + 515565501096.
It is an arithmetic number, because the mean of its divisors is an integer number (515565501096).
Almost surely, 21031131002191 is an apocalyptic number.
1031131002191 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031131002191 is an equidigital number, since it uses as much as digits as its factorization.
1031131002191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 23.
Adding to 1031131002191 its reverse (1912001311301), we get a palindrome (2943132313492).
The spelling of 1031131002191 in words is "one trillion, thirty-one billion, one hundred thirty-one million, two thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •