Base | Representation |
---|---|
bin | 11001000011100111111100… |
… | …011000001001011110111001 |
3 | 112110012001000010011202122111 |
4 | 121003213330120021132321 |
5 | 103421010012241232301 |
6 | 1030213135545052321 |
7 | 32132462636354452 |
oct | 3103477430113671 |
9 | 473161003152574 |
10 | 110200210102201 |
11 | 3212771276427a |
12 | 104396574870a1 |
13 | 4964ab1ca3b5b |
14 | 1d2da0bcb4129 |
15 | cb1861339551 |
hex | 6439fc6097b9 |
110200210102201 has 4 divisors (see below), whose sum is σ = 110244879829072. Its totient is φ = 110155540375332.
The previous prime is 110200210102043. The next prime is 110200210102211. The reversal of 110200210102201 is 102201012002011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110200210102201 - 229 = 110199673231289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110200210102211) 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, 22334859735 + ... + 22334864668.
It is an arithmetic number, because the mean of its divisors is an integer number (27561219957268).
Almost surely, 2110200210102201 is an apocalyptic number.
It is an amenable number.
110200210102201 is a deficient number, since it is larger than the sum of its proper divisors (44669726871).
110200210102201 is an equidigital number, since it uses as much as digits as its factorization.
110200210102201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44669726870.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110200210102201 its reverse (102201012002011), we get a palindrome (212401222104212).
The spelling of 110200210102201 in words is "one hundred ten trillion, two hundred billion, two hundred ten million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •