Base | Representation |
---|---|
bin | 11001000000110110110011… |
… | …000010000011000110011100 |
3 | 112102111212001010012210012121 |
4 | 121000312303002003012130 |
5 | 103404400440224323400 |
6 | 1025545521412112324 |
7 | 32112650243642401 |
oct | 3100666302030634 |
9 | 472455033183177 |
10 | 110010001011100 |
11 | 32063a85685923 |
12 | 104088129056a4 |
13 | 494cb8b253bc8 |
14 | 1d247262882a8 |
15 | cab92c72021a |
hex | 640db308319c |
110010001011100 has 36 divisors (see below), whose sum is σ = 238723364761504. Its totient is φ = 44003693940480.
The previous prime is 110010001011073. The next prime is 110010001011101. The reversal of 110010001011100 is 1110100010011.
It is a happy number.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 10880692 + ... + 18395908.
Almost surely, 2110010001011100 is an apocalyptic number.
110010001011100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110010001011100 is an abundant number, since it is smaller than the sum of its proper divisors (128713363750404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110010001011100 is a wasteful number, since it uses less digits than its factorization.
110010001011100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7661614 (or 7661607 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110010001011100 its reverse (1110100010011), we get a palindrome (111120101021111).
The spelling of 110010001011100 in words is "one hundred ten trillion, ten billion, one million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •