Base | Representation |
---|---|
bin | 11001000000101110100001… |
… | …001001010110011110101001 |
3 | 112102111000002120002110222022 |
4 | 121000232201021112132221 |
5 | 103404224233404013001 |
6 | 1025541451320234225 |
7 | 32112214035051533 |
oct | 3100564111263651 |
9 | 472430076073868 |
10 | 110001111001001 |
11 | 32060233489740 |
12 | 10406b5160b975 |
13 | 494c0a25044bc |
14 | 1d24121704853 |
15 | cab5ac01d11b |
hex | 640ba12567a9 |
110001111001001 has 32 divisors (see below), whose sum is σ = 121687512008832. Its totient is φ = 98604000000000.
The previous prime is 110001111000983. The next prime is 110001111001043. The reversal of 110001111001001 is 100100111100011.
It is a de Polignac number, because none of the positive numbers 2k-110001111001001 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110001111001001.
It is not an unprimeable number, because it can be changed into a prime (110001111001091) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2760982841 + ... + 2761022681.
It is an arithmetic number, because the mean of its divisors is an integer number (3802734750276).
Almost surely, 2110001111001001 is an apocalyptic number.
110001111001001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110001111001001 is a deficient number, since it is larger than the sum of its proper divisors (11686401007831).
110001111001001 is a wasteful number, since it uses less digits than its factorization.
110001111001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50105.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 110001111001001 its reverse (100100111100011), we get a palindrome (210101222101012).
The spelling of 110001111001001 in words is "one hundred ten trillion, one billion, one hundred eleven million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •