Base | Representation |
---|---|
bin | 110011010111110101… |
… | …0011110101110111000 |
3 | 101112202111001021210222 |
4 | 1212233222132232320 |
5 | 3301414230044003 |
6 | 122403024555212 |
7 | 10653602561621 |
oct | 1465752365670 |
9 | 345674037728 |
10 | 110321331128 |
11 | 42872573a28 |
12 | 1946a482b08 |
13 | a531c55c78 |
14 | 54a7b4aa48 |
15 | 2d0a41bc38 |
hex | 19afa9ebb8 |
110321331128 has 16 divisors (see below), whose sum is σ = 213985341000. Its totient is φ = 53258573536.
The previous prime is 110321331121. The next prime is 110321331137. The reversal of 110321331128 is 821133123011.
It is a super-2 number, since 2×1103213311282 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110321331097 and 110321331106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110321331121) 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 in 3 ways as a sum of consecutive naturals, for example, 237761258 + ... + 237761721.
Almost surely, 2110321331128 is an apocalyptic number.
It is an amenable number.
110321331128 is a deficient number, since it is larger than the sum of its proper divisors (103664009872).
110321331128 is a wasteful number, since it uses less digits than its factorization.
110321331128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475523014 (or 475523010 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 26.
Adding to 110321331128 its reverse (821133123011), we get a palindrome (931454454139).
The spelling of 110321331128 in words is "one hundred ten billion, three hundred twenty-one million, three hundred thirty-one thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •