Base | Representation |
---|---|
bin | 11101000111000001010… |
… | …00110100110011001001 |
3 | 10112121200202001000012022 |
4 | 32203200220310303021 |
5 | 112341403002223311 |
6 | 2043252555054225 |
7 | 132155630006162 |
oct | 16434050646311 |
9 | 3477622030168 |
10 | 1000201211081 |
11 | 356201565846 |
12 | 141a19441375 |
13 | 7341ab88157 |
14 | 365a5062769 |
15 | 1b03e25e5db |
hex | e8e0a34cc9 |
1000201211081 has 2 divisors, whose sum is σ = 1000201211082. Its totient is φ = 1000201211080.
The previous prime is 1000201210973. The next prime is 1000201211183. The reversal of 1000201211081 is 1801121020001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 756865200400 + 243336010681 = 869980^2 + 493291^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000201211081 - 214 = 1000201194697 is a prime.
It is a super-3 number, since 3×10002012110813 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1000201214081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500100605540 + 500100605541.
It is an arithmetic number, because the mean of its divisors is an integer number (500100605541).
Almost surely, 21000201211081 is an apocalyptic number.
It is an amenable number.
1000201211081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000201211081 is an equidigital number, since it uses as much as digits as its factorization.
1000201211081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 1000201211081 its reverse (1801121020001), we get a palindrome (2801322231082).
The spelling of 1000201211081 in words is "one trillion, two hundred one million, two hundred eleven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •