Base | Representation |
---|---|
bin | 100000001001010… |
… | …0011001101100001 |
3 | 2210011120210102001 |
4 | 1000102203031201 |
5 | 4202110322031 |
6 | 255010124001 |
7 | 35504662642 |
oct | 10022431541 |
9 | 2704523361 |
10 | 1078604641 |
11 | 5039316a4 |
12 | 261280601 |
13 | 1425cc3ca |
14 | a336d6c9 |
15 | 64a5b861 |
hex | 404a3361 |
1078604641 has 2 divisors, whose sum is σ = 1078604642. Its totient is φ = 1078604640.
The previous prime is 1078604629. The next prime is 1078604663. The reversal of 1078604641 is 1464068701.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1073217600 + 5387041 = 32760^2 + 2321^2 .
It is an emirp because it is prime and its reverse (1464068701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1078604641 - 29 = 1078604129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1078604641.
It is not a weakly prime, because it can be changed into another prime (1078604621) 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 as a sum of consecutive naturals, namely, 539302320 + 539302321.
It is an arithmetic number, because the mean of its divisors is an integer number (539302321).
Almost surely, 21078604641 is an apocalyptic number.
It is an amenable number.
1078604641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1078604641 is an equidigital number, since it uses as much as digits as its factorization.
1078604641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32256, while the sum is 37.
The square root of 1078604641 is about 32842.1168775705. The cubic root of 1078604641 is about 1025.5435201082.
The spelling of 1078604641 in words is "one billion, seventy-eight million, six hundred four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •