Base | Representation |
---|---|
bin | 100000111010110… |
… | …0010000011001101 |
3 | 2211222102001200120 |
4 | 1001311202003031 |
5 | 4230231132031 |
6 | 301334215153 |
7 | 36241352430 |
oct | 10165420315 |
9 | 2758361616 |
10 | 1104552141 |
11 | 517544410 |
12 | 269ab44b9 |
13 | 147ab5964 |
14 | a69a5817 |
15 | 66e84a96 |
hex | 41d620cd |
1104552141 has 16 divisors (see below), whose sum is σ = 1836139008. Its totient is φ = 573793200.
The previous prime is 1104552133. The next prime is 1104552149. The reversal of 1104552141 is 1412554011.
It is an interprime number because it is at equal distance from previous prime (1104552133) and next prime (1104552149).
It is not a de Polignac number, because 1104552141 - 23 = 1104552133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104552149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2390575 + ... + 2391036.
It is an arithmetic number, because the mean of its divisors is an integer number (114758688).
Almost surely, 21104552141 is an apocalyptic number.
1104552141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1104552141 is a deficient number, since it is larger than the sum of its proper divisors (731586867).
1104552141 is a wasteful number, since it uses less digits than its factorization.
1104552141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4781632.
The product of its (nonzero) digits is 800, while the sum is 24.
The square root of 1104552141 is about 33234.8031587371. The cubic root of 1104552141 is about 1033.7021207319.
The spelling of 1104552141 in words is "one billion, one hundred four million, five hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.634 sec. • engine limits •