Base | Representation |
---|---|
bin | 11101000110110101010… |
… | …10111011111000011001 |
3 | 10112121102202122220002112 |
4 | 32203122222323320121 |
5 | 112341201340213311 |
6 | 2043235021242105 |
7 | 132153303045245 |
oct | 16433252737031 |
9 | 3477382586075 |
10 | 1000101101081 |
11 | 35615aaa9705 |
12 | 1419aba03335 |
13 | 73403206574 |
14 | 36595a43425 |
15 | 1b03558728b |
hex | e8daabbe19 |
1000101101081 has 2 divisors, whose sum is σ = 1000101101082. Its totient is φ = 1000101101080.
The previous prime is 1000101101033. The next prime is 1000101101117. The reversal of 1000101101081 is 1801011010001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 650577749056 + 349523352025 = 806584^2 + 591205^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000101101081 - 218 = 1000100838937 is a prime.
It is a super-2 number, since 2×10001011010812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1000101109081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500050550540 + 500050550541.
It is an arithmetic number, because the mean of its divisors is an integer number (500050550541).
Almost surely, 21000101101081 is an apocalyptic number.
It is an amenable number.
1000101101081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000101101081 is an equidigital number, since it uses as much as digits as its factorization.
1000101101081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1000101101081 its reverse (1801011010001), we get a palindrome (2801112111082).
The spelling of 1000101101081 in words is "one trillion, one hundred one million, one hundred one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •