Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0101010100110011001 |
3 | 101112012001211010012001 |
4 | 1212202132222212121 |
5 | 3300441113131301 |
6 | 122325043521001 |
7 | 10645245444145 |
oct | 1464236524631 |
9 | 345161733161 |
10 | 110100130201 |
11 | 42769720446 |
12 | 19408389161 |
13 | a4c8187a49 |
14 | 548660a225 |
15 | 2ce5cc5c01 |
hex | 19a27aa999 |
110100130201 has 2 divisors, whose sum is σ = 110100130202. Its totient is φ = 110100130200.
The previous prime is 110100130183. The next prime is 110100130207. The reversal of 110100130201 is 102031001011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109992385801 + 107744400 = 331651^2 + 10380^2 .
It is a cyclic number.
It is not a de Polignac number, because 110100130201 - 25 = 110100130169 is a prime.
It is not a weakly prime, because it can be changed into another prime (110100130207) 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 as a sum of consecutive naturals, namely, 55050065100 + 55050065101.
It is an arithmetic number, because the mean of its divisors is an integer number (55050065101).
Almost surely, 2110100130201 is an apocalyptic number.
It is an amenable number.
110100130201 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100130201 is an equidigital number, since it uses as much as digits as its factorization.
110100130201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 110100130201 its reverse (102031001011), we get a palindrome (212131131212).
The spelling of 110100130201 in words is "one hundred ten billion, one hundred million, one hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •