Base | Representation |
---|---|
bin | 10101011000111001… |
… | …01110011111001100 |
3 | 1002122021120021012200 |
4 | 22230130232133030 |
5 | 142004141134223 |
6 | 5135243401500 |
7 | 554364063213 |
oct | 125434563714 |
9 | 32567507180 |
10 | 11483146188 |
11 | 4962a33768 |
12 | 2285823290 |
13 | 111005b377 |
14 | 7ad11a07a |
15 | 4731c8a43 |
hex | 2ac72e7cc |
11483146188 has 18 divisors (see below), whose sum is σ = 29026841844. Its totient is φ = 3827715384.
The previous prime is 11483146187. The next prime is 11483146189. The reversal of 11483146188 is 88164138411.
11483146188 is a `hidden beast` number, since 1 + 14 + 8 + 3 + 14 + 618 + 8 = 666.
It is an interprime number because it is at equal distance from previous prime (11483146187) and next prime (11483146189).
It is a tau number, because it is divible by the number of its divisors (18).
It is not an unprimeable number, because it can be changed into a prime (11483146187) 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 5 ways as a sum of consecutive naturals, for example, 159488106 + ... + 159488177.
Almost surely, 211483146188 is an apocalyptic number.
11483146188 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
11483146188 is an abundant number, since it is smaller than the sum of its proper divisors (17543695656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11483146188 is a wasteful number, since it uses less digits than its factorization.
11483146188 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318976293 (or 318976288 counting only the distinct ones).
The product of its digits is 147456, while the sum is 45.
The spelling of 11483146188 in words is "eleven billion, four hundred eighty-three million, one hundred forty-six thousand, one hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •