Base | Representation |
---|---|
bin | 11001000000110110110011… |
… | …000010000011000100111001 |
3 | 112102111212001010012210001221 |
4 | 121000312303002003010321 |
5 | 103404400440224323001 |
6 | 1025545521412112041 |
7 | 32112650243642200 |
oct | 3100666302030471 |
9 | 472455033183057 |
10 | 110010001011001 |
11 | 32063a85685843 |
12 | 10408812905621 |
13 | 494cb8b253b50 |
14 | 1d24726288237 |
15 | cab92c7201a1 |
hex | 640db3083139 |
110010001011001 has 48 divisors (see below), whose sum is σ = 141007136256000. Its totient is φ = 85031468081280.
The previous prime is 110010001010981. The next prime is 110010001011019. The reversal of 110010001011001 is 100110100010011.
It is a happy number.
It is not a de Polignac number, because 110010001011001 - 211 = 110010001008953 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is not an unprimeable number, because it can be changed into a prime (110010001011101) 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 in 47 ways as a sum of consecutive naturals, for example, 12801000 + ... + 19592998.
It is an arithmetic number, because the mean of its divisors is an integer number (2937648672000).
Almost surely, 2110010001011001 is an apocalyptic number.
It is an amenable number.
110010001011001 is a deficient number, since it is larger than the sum of its proper divisors (30997135244999).
110010001011001 is a wasteful number, since it uses less digits than its factorization.
110010001011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6792614 (or 6792607 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110010001011001 its reverse (100110100010011), we get a palindrome (210120101021012).
The spelling of 110010001011001 in words is "one hundred ten trillion, ten billion, one million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.075 sec. • engine limits •