Base | Representation |
---|---|
bin | 1001000110101010001100… |
… | …0101110100011000011001 |
3 | 1022102221120210211111200111 |
4 | 2101222203011310120121 |
5 | 2303001000030324121 |
6 | 33142311330204321 |
7 | 2052125244133306 |
oct | 221524305643031 |
9 | 38387523744614 |
10 | 10010010011161 |
11 | 320a248766616 |
12 | 11580101236a1 |
13 | 577c2ac3c654 |
14 | 2686b673a0ad |
15 | 1255b3b2c2e1 |
hex | 91aa3174619 |
10010010011161 has 2 divisors, whose sum is σ = 10010010011162. Its totient is φ = 10010010011160.
The previous prime is 10010010011159. The next prime is 10010010011213. The reversal of 10010010011161 is 16111001001001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5674786316761 + 4335223694400 = 2382181^2 + 2082120^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010010011161 - 21 = 10010010011159 is a prime.
Together with 10010010011159, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10010010018161) 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, 5005005005580 + 5005005005581.
It is an arithmetic number, because the mean of its divisors is an integer number (5005005005581).
Almost surely, 210010010011161 is an apocalyptic number.
It is an amenable number.
10010010011161 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010010011161 is an equidigital number, since it uses as much as digits as its factorization.
10010010011161 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 10010010011161 its reverse (16111001001001), we get a palindrome (26121011012162).
The spelling of 10010010011161 in words is "ten trillion, ten billion, ten million, eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •