Base | Representation |
---|---|
bin | 110011001110111000… |
… | …1100111011101100001 |
3 | 101111222120022122202202 |
4 | 1212131301213131201 |
5 | 3300310412241001 |
6 | 122313144222545 |
7 | 10643266605011 |
oct | 1463561473541 |
9 | 344876278682 |
10 | 110021212001 |
11 | 42729118a98 |
12 | 193a5a6aa55 |
13 | a4b4a15b9c |
14 | 5479d45c41 |
15 | 2cdddd796b |
hex | 199dc67761 |
110021212001 has 2 divisors, whose sum is σ = 110021212002. Its totient is φ = 110021212000.
The previous prime is 110021211967. The next prime is 110021212069. The reversal of 110021212001 is 100212120011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104574624400 + 5446587601 = 323380^2 + 73801^2 .
It is an emirp because it is prime and its reverse (100212120011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110021212001 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (110021212601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55010606000 + 55010606001.
It is an arithmetic number, because the mean of its divisors is an integer number (55010606001).
Almost surely, 2110021212001 is an apocalyptic number.
It is an amenable number.
110021212001 is a deficient number, since it is larger than the sum of its proper divisors (1).
110021212001 is an equidigital number, since it uses as much as digits as its factorization.
110021212001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110021212001 its reverse (100212120011), we get a palindrome (210233332012).
The spelling of 110021212001 in words is "one hundred ten billion, twenty-one million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •