Base | Representation |
---|---|
bin | 10110111111001110110000… |
… | …110010001010110011010001 |
3 | 111020222021110020011212202112 |
4 | 112333032300302022303101 |
5 | 101222424301441401001 |
6 | 555005413205555105 |
7 | 30203251536121142 |
oct | 2677166062126321 |
9 | 436867406155675 |
10 | 101102201122001 |
11 | 2a23a225893762 |
12 | b40a34a715a95 |
13 | 4454b86c56471 |
14 | 1ad7530769ac9 |
15 | ba4d7860ecbb |
hex | 5bf3b0c8acd1 |
101102201122001 has 2 divisors, whose sum is σ = 101102201122002. Its totient is φ = 101102201122000.
The previous prime is 101102201121991. The next prime is 101102201122009. The reversal of 101102201122001 is 100221102201101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60642119163025 + 40460081958976 = 7787305^2 + 6360824^2 .
It is a cyclic number.
It is not a de Polignac number, because 101102201122001 - 26 = 101102201121937 is a prime.
It is not a weakly prime, because it can be changed into another prime (101102201122009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50551100561000 + 50551100561001.
It is an arithmetic number, because the mean of its divisors is an integer number (50551100561001).
Almost surely, 2101102201122001 is an apocalyptic number.
It is an amenable number.
101102201122001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101102201122001 is an equidigital number, since it uses as much as digits as its factorization.
101102201122001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101102201122001 its reverse (100221102201101), we get a palindrome (201323303323102).
The spelling of 101102201122001 in words is "one hundred one trillion, one hundred two billion, two hundred one million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •