Base | Representation |
---|---|
bin | 11101000110110101010… |
… | …10111110000110010001 |
3 | 10112121102202200100112211 |
4 | 32203122222332012101 |
5 | 112341201341011121 |
6 | 2043235021352121 |
7 | 132153303113566 |
oct | 16433252760621 |
9 | 3477382610484 |
10 | 1000101110161 |
11 | 35616000550a |
12 | 1419aba08641 |
13 | 7340320a73a |
14 | 36595a4686d |
15 | 1b035589ce1 |
hex | e8daabe191 |
1000101110161 has 2 divisors, whose sum is σ = 1000101110162. Its totient is φ = 1000101110160.
The previous prime is 1000101110083. The next prime is 1000101110209. The reversal of 1000101110161 is 1610111010001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 961270437136 + 38830673025 = 980444^2 + 197055^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000101110161 - 233 = 991511175569 is a prime.
It is not a weakly prime, because it can be changed into another prime (1000101110761) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500050555080 + 500050555081.
It is an arithmetic number, because the mean of its divisors is an integer number (500050555081).
Almost surely, 21000101110161 is an apocalyptic number.
It is an amenable number.
1000101110161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000101110161 is an equidigital number, since it uses as much as digits as its factorization.
1000101110161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 1000101110161 its reverse (1610111010001), we get a palindrome (2610212120162).
The spelling of 1000101110161 in words is "one trillion, one hundred one million, one hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •