Base | Representation |
---|---|
bin | 11101000110101111010… |
… | …00000000010010000111 |
3 | 10112121022012111202000002 |
4 | 32203113220000102013 |
5 | 112341100300013111 |
6 | 2043225554111515 |
7 | 132152112516434 |
oct | 16432750002207 |
9 | 3477265452002 |
10 | 1000050001031 |
11 | 356134177464 |
12 | 14199687b59b |
13 | 733c5754553 |
14 | 3658cd40b8b |
15 | 1b030d4163b |
hex | e8d7a00487 |
1000050001031 has 2 divisors, whose sum is σ = 1000050001032. Its totient is φ = 1000050001030.
The previous prime is 1000050000973. The next prime is 1000050001051. The reversal of 1000050001031 is 1301000500001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1000050001031 - 218 = 1000049738887 is a prime.
It is a super-2 number, since 2×10000500010312 (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 (1000050001051) 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, 500025000515 + 500025000516.
It is an arithmetic number, because the mean of its divisors is an integer number (500025000516).
Almost surely, 21000050001031 is an apocalyptic number.
1000050001031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000050001031 is an equidigital number, since it uses as much as digits as its factorization.
1000050001031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15, while the sum is 11.
Adding to 1000050001031 its reverse (1301000500001), we get a palindrome (2301050501032).
The spelling of 1000050001031 in words is "one trillion, fifty million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •