Base | Representation |
---|---|
bin | 110011010001010001… |
… | …0000100000101001001 |
3 | 101112012010111101010122 |
4 | 1212202202010011021 |
5 | 3300441330133001 |
6 | 122325114553025 |
7 | 10645256144216 |
oct | 1464242040511 |
9 | 345163441118 |
10 | 110101021001 |
11 | 4276a179744 |
12 | 19408738775 |
13 | a4c840a34a |
14 | 548679cb0d |
15 | 2ce5deeb1b |
hex | 19a2884149 |
110101021001 has 8 divisors (see below), whose sum is σ = 115902299520. Its totient is φ = 104300391312.
The previous prime is 110101020989. The next prime is 110101021087. The reversal of 110101021001 is 100120101011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110101021001 - 218 = 110100758857 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110101021001.
It is not an unprimeable number, because it can be changed into a prime (110101021501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 207776 + ... + 513198.
It is an arithmetic number, because the mean of its divisors is an integer number (14487787440).
Almost surely, 2110101021001 is an apocalyptic number.
It is an amenable number.
110101021001 is a deficient number, since it is larger than the sum of its proper divisors (5801278519).
110101021001 is a wasteful number, since it uses less digits than its factorization.
110101021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324415.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 110101021001 its reverse (100120101011), we get a palindrome (210221122012).
The spelling of 110101021001 in words is "one hundred ten billion, one hundred one million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •