Base | Representation |
---|---|
bin | 100000001001111… |
… | …1011101001111101 |
3 | 2210012021012100101 |
4 | 1000103323221331 |
5 | 4202203420114 |
6 | 255022001101 |
7 | 35511032056 |
oct | 10023735175 |
9 | 2705235311 |
10 | 1078966909 |
11 | 504059899 |
12 | 261416191 |
13 | 1426c8277 |
14 | a342572d |
15 | 64acdd74 |
hex | 404fba7d |
1078966909 has 2 divisors, whose sum is σ = 1078966910. Its totient is φ = 1078966908.
The previous prime is 1078966901. The next prime is 1078966979. The reversal of 1078966909 is 9096698701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1062564409 + 16402500 = 32597^2 + 4050^2 .
It is an emirp because it is prime and its reverse (9096698701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1078966909 - 23 = 1078966901 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1078966909.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1078966901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 539483454 + 539483455.
It is an arithmetic number, because the mean of its divisors is an integer number (539483455).
Almost surely, 21078966909 is an apocalyptic number.
It is an amenable number.
1078966909 is a deficient number, since it is larger than the sum of its proper divisors (1).
1078966909 is an equidigital number, since it uses as much as digits as its factorization.
1078966909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1469664, while the sum is 55.
The square root of 1078966909 is about 32847.6317106728. The cubic root of 1078966909 is about 1025.6583227583.
The spelling of 1078966909 in words is "one billion, seventy-eight million, nine hundred sixty-six thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •