Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1111100111111111001 |
3 | 101112110002212111020102 |
4 | 1212220133330333321 |
5 | 3301142442143001 |
6 | 122343052405145 |
7 | 10650613105133 |
oct | 1465037747771 |
9 | 345402774212 |
10 | 110201131001 |
11 | 42810735885 |
12 | 194361767b5 |
13 | a51308bc30 |
14 | 5495bbc053 |
15 | 2ceeac6e6b |
hex | 19a87fcff9 |
110201131001 has 4 divisors (see below), whose sum is σ = 118678141092. Its totient is φ = 101724120912.
The previous prime is 110201130947. The next prime is 110201131031. The reversal of 110201131001 is 100131102011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100131102011 = 113 ⋅886115947.
It can be written as a sum of positive squares in 2 ways, for example, as 56560254976 + 53640876025 = 237824^2 + 231605^2 .
It is a cyclic number.
It is not a de Polignac number, because 110201131001 - 210 = 110201129977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110201131031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4238505026 + ... + 4238505051.
It is an arithmetic number, because the mean of its divisors is an integer number (29669535273).
Almost surely, 2110201131001 is an apocalyptic number.
It is an amenable number.
110201131001 is a deficient number, since it is larger than the sum of its proper divisors (8477010091).
110201131001 is an equidigital number, since it uses as much as digits as its factorization.
110201131001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8477010090.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 110201131001 its reverse (100131102011), we get a palindrome (210332233012).
The spelling of 110201131001 in words is "one hundred ten billion, two hundred one million, one hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •