Base | Representation |
---|---|
bin | 110011010100110100… |
… | …0010111000010000001 |
3 | 101112111102120211021102 |
4 | 1212221220113002001 |
5 | 3301212322041001 |
6 | 122345011304145 |
7 | 10651233331256 |
oct | 1465150270201 |
9 | 345442524242 |
10 | 110220112001 |
11 | 4282041a55a |
12 | 194405ab055 |
13 | a516ca65ac |
14 | 549851d42d |
15 | 2d015c5e6b |
hex | 19a9a17081 |
110220112001 has 2 divisors, whose sum is σ = 110220112002. Its totient is φ = 110220112000.
The previous prime is 110220111997. The next prime is 110220112021. The reversal of 110220112001 is 100211022011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102913281601 + 7306830400 = 320801^2 + 85480^2 .
It is a cyclic number.
It is not a de Polignac number, because 110220112001 - 22 = 110220111997 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 (110220112021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110056000 + 55110056001.
It is an arithmetic number, because the mean of its divisors is an integer number (55110056001).
Almost surely, 2110220112001 is an apocalyptic number.
It is an amenable number.
110220112001 is a deficient number, since it is larger than the sum of its proper divisors (1).
110220112001 is an equidigital number, since it uses as much as digits as its factorization.
110220112001 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 110220112001 its reverse (100211022011), we get a palindrome (210431134012).
The spelling of 110220112001 in words is "one hundred ten billion, two hundred twenty million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •