Base | Representation |
---|---|
bin | 1001010010011001001011… |
… | …0110011011101001101001 |
3 | 1100011012221000212001122121 |
4 | 2110212102312123221221 |
5 | 2314301324324131121 |
6 | 33415051132551241 |
7 | 2102522664250633 |
oct | 224462266335151 |
9 | 40135830761577 |
10 | 10211601005161 |
11 | 3287796608096 |
12 | 118b0b0622521 |
13 | 590c46a6029a |
14 | 27435bc49a53 |
15 | 12a961ac2141 |
hex | 94992d9ba69 |
10211601005161 has 2 divisors, whose sum is σ = 10211601005162. Its totient is φ = 10211601005160.
The previous prime is 10211601005117. The next prime is 10211601005227. The reversal of 10211601005161 is 16150010611201.
10211601005161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9843812125225 + 367788879936 = 3137485^2 + 606456^2 .
It is a cyclic number.
It is not a de Polignac number, because 10211601005161 - 223 = 10211592616553 is a prime.
It is not a weakly prime, because it can be changed into another prime (10211601305161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105800502580 + 5105800502581.
It is an arithmetic number, because the mean of its divisors is an integer number (5105800502581).
Almost surely, 210211601005161 is an apocalyptic number.
It is an amenable number.
10211601005161 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211601005161 is an equidigital number, since it uses as much as digits as its factorization.
10211601005161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 360, while the sum is 25.
Adding to 10211601005161 its reverse (16150010611201), we get a palindrome (26361611616362).
The spelling of 10211601005161 in words is "ten trillion, two hundred eleven billion, six hundred one million, five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •