Base | Representation |
---|---|
bin | 100001011001001… |
… | …0010110001000111 |
3 | 2220002101022001101 |
4 | 1002302102301013 |
5 | 4243320332302 |
6 | 303103440531 |
7 | 36523632331 |
oct | 10262226107 |
9 | 2802338041 |
10 | 1120480327 |
11 | 5255334aa |
12 | 2732b6147 |
13 | 14b1a1915 |
14 | a8b50451 |
15 | 6857e287 |
hex | 42c92c47 |
1120480327 has 4 divisors (see below), whose sum is σ = 1120565736. Its totient is φ = 1120394920.
The previous prime is 1120480307. The next prime is 1120480357. The reversal of 1120480327 is 7230840211.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1120480327 - 27 = 1120480199 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1120480295 and 1120480304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120480307) 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 3 ways as a sum of consecutive naturals, for example, 18424 + ... + 50797.
It is an arithmetic number, because the mean of its divisors is an integer number (280141434).
Almost surely, 21120480327 is an apocalyptic number.
1120480327 is a deficient number, since it is larger than the sum of its proper divisors (85409).
1120480327 is an equidigital number, since it uses as much as digits as its factorization.
1120480327 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85408.
The product of its (nonzero) digits is 2688, while the sum is 28.
The square root of 1120480327 is about 33473.5765492724. The cubic root of 1120480327 is about 1038.6472571951.
The spelling of 1120480327 in words is "one billion, one hundred twenty million, four hundred eighty thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •