Base | Representation |
---|---|
bin | 11001000010010101000100… |
… | …001001111011001100100001 |
3 | 112102212112022020122012022010 |
4 | 121002111010021323030201 |
5 | 103413030234311120001 |
6 | 1030104221322503133 |
7 | 32123162452216614 |
oct | 3102250411731441 |
9 | 472775266565263 |
10 | 110111220020001 |
11 | 320a29a71203a2 |
12 | 10424360964aa9 |
13 | 495959c482095 |
14 | 1d295a918617b |
15 | cae3a399c8d6 |
hex | 64254427b321 |
110111220020001 has 8 divisors (see below), whose sum is σ = 149221762650304. Its totient is φ = 72204078701520.
The previous prime is 110111220019883. The next prime is 110111220020017. The reversal of 110111220020001 is 100020022111011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-110111220020001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110111221020001) 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, 300850327741 + ... + 300850328106.
It is an arithmetic number, because the mean of its divisors is an integer number (18652720331288).
Almost surely, 2110111220020001 is an apocalyptic number.
It is an amenable number.
110111220020001 is a deficient number, since it is larger than the sum of its proper divisors (39110542630303).
110111220020001 is an equidigital number, since it uses as much as digits as its factorization.
110111220020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 601700655911.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110111220020001 its reverse (100020022111011), we get a palindrome (210131242131012).
The spelling of 110111220020001 in words is "one hundred ten trillion, one hundred eleven billion, two hundred twenty million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •