Base | Representation |
---|---|
bin | 11001000010001010100111… |
… | …011001010111100110011001 |
3 | 112102211110100022101202121221 |
4 | 121002022213121113212121 |
5 | 103412334300012023001 |
6 | 1030055124121132041 |
7 | 32122314432446635 |
oct | 3102124731274631 |
9 | 472743308352557 |
10 | 110100000111001 |
11 | 3209916984172a |
12 | 1042214b32a021 |
13 | 4958501b1c584 |
14 | 1d28c22dcddc5 |
15 | cade489701a1 |
hex | 6422a7657999 |
110100000111001 has 2 divisors, whose sum is σ = 110100000111002. Its totient is φ = 110100000111000.
The previous prime is 110100000110957. The next prime is 110100000111007. The reversal of 110100000111001 is 100111000001011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109798543110400 + 301457000601 = 10478480^2 + 549051^2 .
It is a cyclic number.
It is not a de Polignac number, because 110100000111001 - 213 = 110100000102809 is a prime.
It is not a weakly prime, because it can be changed into another prime (110100000111007) 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 as a sum of consecutive naturals, namely, 55050000055500 + 55050000055501.
It is an arithmetic number, because the mean of its divisors is an integer number (55050000055501).
Almost surely, 2110100000111001 is an apocalyptic number.
It is an amenable number.
110100000111001 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100000111001 is an equidigital number, since it uses as much as digits as its factorization.
110100000111001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110100000111001 its reverse (100111000001011), we get a palindrome (210211000112012).
The spelling of 110100000111001 in words is "one hundred ten trillion, one hundred billion, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •