Base | Representation |
---|---|
bin | 100001011000010… |
… | …0010011101010101 |
3 | 2220001111221000200 |
4 | 1002300202131111 |
5 | 4243211122214 |
6 | 303045531113 |
7 | 36520005222 |
oct | 10260423525 |
9 | 2801457020 |
10 | 1120020309 |
11 | 525249921 |
12 | 273113a99 |
13 | 14b070415 |
14 | a8a70949 |
15 | 684dcd09 |
hex | 42c22755 |
1120020309 has 12 divisors (see below), whose sum is σ = 1618621836. Its totient is φ = 746304192.
The previous prime is 1120020301. The next prime is 1120020331. The reversal of 1120020309 is 9030200211.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 292307409 + 827712900 = 17097^2 + 28770^2 .
It is not a de Polignac number, because 1120020309 - 23 = 1120020301 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1120020291 and 1120020300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120020301) 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 11 ways as a sum of consecutive naturals, for example, 11832 + ... + 48785.
It is an arithmetic number, because the mean of its divisors is an integer number (134885153).
Almost surely, 21120020309 is an apocalyptic number.
It is an amenable number.
1120020309 is a deficient number, since it is larger than the sum of its proper divisors (498601527).
1120020309 is a wasteful number, since it uses less digits than its factorization.
1120020309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62676 (or 62673 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
The square root of 1120020309 is about 33466.7044837104. The cubic root of 1120020309 is about 1038.5050973777.
The spelling of 1120020309 in words is "one billion, one hundred twenty million, twenty thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •