Base | Representation |
---|---|
bin | 100001011000010… |
… | …1001010000101001 |
3 | 2220001120100020112 |
4 | 1002300221100221 |
5 | 4243213020134 |
6 | 303050304105 |
7 | 36520152362 |
oct | 10260512051 |
9 | 2801510215 |
10 | 1120048169 |
11 | 525268849 |
12 | 273128035 |
13 | 14b07ccc6 |
14 | a8a7ab69 |
15 | 684e61ce |
hex | 42c29429 |
1120048169 has 4 divisors (see below), whose sum is σ = 1121472144. Its totient is φ = 1118624196.
The previous prime is 1120048147. The next prime is 1120048177. The reversal of 1120048169 is 9618400211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1120048169 - 28 = 1120047913 is a prime.
It is a super-2 number, since 2×11200481692 = 2509015801760505122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1120048129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 710807 + ... + 712380.
It is an arithmetic number, because the mean of its divisors is an integer number (280368036).
Almost surely, 21120048169 is an apocalyptic number.
It is an amenable number.
1120048169 is a deficient number, since it is larger than the sum of its proper divisors (1423975).
1120048169 is an equidigital number, since it uses as much as digits as its factorization.
1120048169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1423974.
The product of its (nonzero) digits is 3456, while the sum is 32.
The square root of 1120048169 is about 33467.1207157114. The cubic root of 1120048169 is about 1038.5137080882.
The spelling of 1120048169 in words is "one billion, one hundred twenty million, forty-eight thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •