Base | Representation |
---|---|
bin | 11001000000110111110100… |
… | …100010010111001011101001 |
3 | 112102111221212201011020221021 |
4 | 121000313310202113023221 |
5 | 103404410213100013001 |
6 | 1025550222431212441 |
7 | 32113016420130523 |
oct | 3100676442271351 |
9 | 472457781136837 |
10 | 110011100001001 |
11 | 32064499a70241 |
12 | 10408a7a977121 |
13 | 4950004b3cba4 |
14 | 1d247cc202a13 |
15 | cab993e56ba1 |
hex | 640df48972e9 |
110011100001001 has 2 divisors, whose sum is σ = 110011100001002. Its totient is φ = 110011100001000.
The previous prime is 110011100000981. The next prime is 110011100001053. The reversal of 110011100001001 is 100100001110011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69469291110976 + 40541808890025 = 8334824^2 + 6367245^2 .
It is a cyclic number.
It is not a de Polignac number, because 110011100001001 - 221 = 110011097903849 is a prime.
It is not a weakly prime, because it can be changed into another prime (110011100007001) 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, 55005550000500 + 55005550000501.
It is an arithmetic number, because the mean of its divisors is an integer number (55005550000501).
Almost surely, 2110011100001001 is an apocalyptic number.
It is an amenable number.
110011100001001 is a deficient number, since it is larger than the sum of its proper divisors (1).
110011100001001 is an equidigital number, since it uses as much as digits as its factorization.
110011100001001 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 110011100001001 its reverse (100100001110011), we get a palindrome (210111101111012).
The spelling of 110011100001001 in words is "one hundred ten trillion, eleven billion, one hundred million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •