Base | Representation |
---|---|
bin | 11110000000101000011… |
… | …00100110110011101011 |
3 | 10122120112021220002020122 |
4 | 33000110030212303223 |
5 | 113343224014000133 |
6 | 2105410043513455 |
7 | 134332246613054 |
oct | 17002414466353 |
9 | 3576467802218 |
10 | 1031131000043 |
11 | 368333628001 |
12 | 147a0b82888b |
13 | 76309a76821 |
14 | 37c9ab7d72b |
15 | 1bc4e7eb498 |
hex | f014326ceb |
1031131000043 has 2 divisors, whose sum is σ = 1031131000044. Its totient is φ = 1031131000042.
The previous prime is 1031131000021. The next prime is 1031131000073. The reversal of 1031131000043 is 3400001311301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1031131000043 - 228 = 1030862564587 is a prime.
It is a super-2 number, since 2×10311310000432 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1031130999985 and 1031131000030.
It is not a weakly prime, because it can be changed into another prime (1031131000073) 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, 515565500021 + 515565500022.
It is an arithmetic number, because the mean of its divisors is an integer number (515565500022).
Almost surely, 21031131000043 is an apocalyptic number.
1031131000043 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031131000043 is an equidigital number, since it uses as much as digits as its factorization.
1031131000043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1031131000043 its reverse (3400001311301), we get a palindrome (4431132311344).
The spelling of 1031131000043 in words is "one trillion, thirty-one billion, one hundred thirty-one million, forty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •