Base | Representation |
---|---|
bin | 11001000010010101111001… |
… | …110110111001010000101001 |
3 | 112102212121122000222202212210 |
4 | 121002111321312321100221 |
5 | 103413034110434013001 |
6 | 1030104450545555333 |
7 | 32123224002352440 |
oct | 3102257166712051 |
9 | 472777560882783 |
10 | 110112121001001 |
11 | 320a3319762799 |
12 | 10424572645b49 |
13 | 49596b4030132 |
14 | 1d29652ab9d57 |
15 | cae407b1edd6 |
hex | 642579db9429 |
110112121001001 has 8 divisors (see below), whose sum is σ = 167789898668224. Its totient is φ = 62921212000560.
The previous prime is 110112121000993. The next prime is 110112121001011. The reversal of 110112121001001 is 100100121211011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110112121001001 - 23 = 110112121000993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110112121001011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2621717166670 + ... + 2621717166711.
It is an arithmetic number, because the mean of its divisors is an integer number (20973737333528).
Almost surely, 2110112121001001 is an apocalyptic number.
It is an amenable number.
110112121001001 is a deficient number, since it is larger than the sum of its proper divisors (57677777667223).
110112121001001 is an equidigital number, since it uses as much as digits as its factorization.
110112121001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5243434333391.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110112121001001 its reverse (100100121211011), we get a palindrome (210212242212012).
The spelling of 110112121001001 in words is "one hundred ten trillion, one hundred twelve billion, one hundred twenty-one million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •