Base | Representation |
---|---|
bin | 11101011001100000000… |
… | …01100100001010010111 |
3 | 10120120022012200200200012 |
4 | 32230300001210022113 |
5 | 113022212443444231 |
6 | 2052013310110435 |
7 | 132656535045341 |
oct | 16546001441227 |
9 | 3516265620605 |
10 | 1010123031191 |
11 | 35a43313207a |
12 | 1439281ab41b |
13 | 7433c601821 |
14 | 36c66a74291 |
15 | 1b420327e2b |
hex | eb30064297 |
1010123031191 has 2 divisors, whose sum is σ = 1010123031192. Its totient is φ = 1010123031190.
The previous prime is 1010123031173. The next prime is 1010123031259. The reversal of 1010123031191 is 1911303210101.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (1911303210101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010123031191 is a prime.
It is a super-4 number, since 4×10101230311914 (a number of 49 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010123031991) 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, 505061515595 + 505061515596.
It is an arithmetic number, because the mean of its divisors is an integer number (505061515596).
Almost surely, 21010123031191 is an apocalyptic number.
1010123031191 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010123031191 is an equidigital number, since it uses as much as digits as its factorization.
1010123031191 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 1010123031191 its reverse (1911303210101), we get a palindrome (2921426241292).
The spelling of 1010123031191 in words is "one trillion, ten billion, one hundred twenty-three million, thirty-one thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.608 sec. • engine limits •