Base | Representation |
---|---|
bin | 11001000000110111111011… |
… | …001110010111100100001001 |
3 | 112102111222011112021120022012 |
4 | 121000313323032113210021 |
5 | 103404410430310401301 |
6 | 1025550241520105305 |
7 | 32113022251612064 |
oct | 3100677316274411 |
9 | 472458145246265 |
10 | 110011212200201 |
11 | 32064547334154 |
12 | 10408ab0465235 |
13 | 4950022165250 |
14 | 1d247dd08b8db |
15 | cab99dc1aebb |
hex | 640dfb397909 |
110011212200201 has 16 divisors (see below), whose sum is σ = 122559376741200. Its totient is φ = 98046754837248.
The previous prime is 110011212200117. The next prime is 110011212200221. The reversal of 110011212200201 is 102002212110011.
It can be written as a sum of positive squares in 8 ways, for example, as 24274353463801 + 85736858736400 = 4926901^2 + 9259420^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110011212200201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110011212200221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 160288595 + ... + 160973463.
It is an arithmetic number, because the mean of its divisors is an integer number (7659961046325).
Almost surely, 2110011212200201 is an apocalyptic number.
It is an amenable number.
110011212200201 is a deficient number, since it is larger than the sum of its proper divisors (12548164540999).
110011212200201 is a wasteful number, since it uses less digits than its factorization.
110011212200201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1110988.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110011212200201 its reverse (102002212110011), we get a palindrome (212013424310212).
The spelling of 110011212200201 in words is "one hundred ten trillion, eleven billion, two hundred twelve million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •