Base | Representation |
---|---|
bin | 11001000001000000001101… |
… | …000010110101101001111001 |
3 | 112102112211010000022120111210 |
4 | 121001000031002311221321 |
5 | 103410032131340232301 |
6 | 1025554311532113333 |
7 | 32113455445206213 |
oct | 3101001502655171 |
9 | 472484100276453 |
10 | 110020101102201 |
11 | 32068298943854 |
12 | 1040a771305849 |
13 | 4950b0a8b7484 |
14 | 1d250038235b3 |
15 | cabd1e29ead6 |
hex | 64100d0b5a79 |
110020101102201 has 8 divisors (see below), whose sum is σ = 146727606731104. Its totient is φ = 73329664770720.
The previous prime is 110020101102187. The next prime is 110020101102203. The reversal of 110020101102201 is 102201101020011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110020101102201 - 25 = 110020101102169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110020101102203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4267309315 + ... + 4267335096.
It is an arithmetic number, because the mean of its divisors is an integer number (18340950841388).
Almost surely, 2110020101102201 is an apocalyptic number.
It is an amenable number.
110020101102201 is a deficient number, since it is larger than the sum of its proper divisors (36707505628903).
110020101102201 is an equidigital number, since it uses as much as digits as its factorization.
110020101102201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8534648711.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110020101102201 its reverse (102201101020011), we get a palindrome (212221202122212).
The spelling of 110020101102201 in words is "one hundred ten trillion, twenty billion, one hundred one million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •