Base | Representation |
---|---|
bin | 11001000011111010011001… |
… | …001000111010100110111011 |
3 | 112110020221010200222220100211 |
4 | 121003322121020322212323 |
5 | 103421321100110014321 |
6 | 1030230213404011551 |
7 | 32134063562623201 |
oct | 3103723110724673 |
9 | 473227120886324 |
10 | 110220020001211 |
11 | 3213505895163a |
12 | 10441465830bb7 |
13 | 496691b17c0a3 |
14 | 1d3096ac33071 |
15 | cb21205540e1 |
hex | 643e9923a9bb |
110220020001211 has 4 divisors (see below), whose sum is σ = 110220041251792. Its totient is φ = 110219998750632.
The previous prime is 110220020001209. The next prime is 110220020001227. The reversal of 110220020001211 is 112100020022011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110220020001211 - 21 = 110220020001209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110220020001191 and 110220020001200.
It is not an unprimeable number, because it can be changed into a prime (110220020001271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2858521 + ... + 15119893.
It is an arithmetic number, because the mean of its divisors is an integer number (27555010312948).
Almost surely, 2110220020001211 is an apocalyptic number.
110220020001211 is a deficient number, since it is larger than the sum of its proper divisors (21250581).
110220020001211 is an equidigital number, since it uses as much as digits as its factorization.
110220020001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21250580.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110220020001211 its reverse (112100020022011), we get a palindrome (222320040023222).
The spelling of 110220020001211 in words is "one hundred ten trillion, two hundred twenty billion, twenty million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •