Base | Representation |
---|---|
bin | 11101001000100001111… |
… | …01110100101110010001 |
3 | 10112200210020201110220022 |
4 | 32210100331310232101 |
5 | 112400033034202121 |
6 | 2043505241353225 |
7 | 132215003540654 |
oct | 16442075645621 |
9 | 3480706643808 |
10 | 1001012022161 |
11 | 356588210148 |
12 | 142004a98815 |
13 | 73519b54b18 |
14 | 36640a0389b |
15 | 1b08a51eaab |
hex | e910f74b91 |
1001012022161 has 2 divisors, whose sum is σ = 1001012022162. Its totient is φ = 1001012022160.
The previous prime is 1001012022133. The next prime is 1001012022163. The reversal of 1001012022161 is 1612202101001.
1001012022161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 661385321536 + 339626700625 = 813256^2 + 582775^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001012022161 - 230 = 999938280337 is a prime.
Together with 1001012022163, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1001012022163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500506011080 + 500506011081.
It is an arithmetic number, because the mean of its divisors is an integer number (500506011081).
Almost surely, 21001012022161 is an apocalyptic number.
It is an amenable number.
1001012022161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001012022161 is an equidigital number, since it uses as much as digits as its factorization.
1001012022161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1001012022161 its reverse (1612202101001), we get a palindrome (2613214123162).
The spelling of 1001012022161 in words is "one trillion, one billion, twelve million, twenty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •