Base | Representation |
---|---|
bin | 100111001111010… |
… | …0100011111100001 |
3 | 10101202111001221001 |
4 | 1032132210133201 |
5 | 10144024333031 |
6 | 334352032001 |
7 | 44425140535 |
oct | 11636443741 |
9 | 3352431831 |
10 | 1316636641 |
11 | 616230661 |
12 | 308b32601 |
13 | 17ca11548 |
14 | c6c11bc5 |
15 | 7a8c9861 |
hex | 4e7a47e1 |
1316636641 has 2 divisors, whose sum is σ = 1316636642. Its totient is φ = 1316636640.
The previous prime is 1316636623. The next prime is 1316636683. The reversal of 1316636641 is 1466366131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 892276641 + 424360000 = 29871^2 + 20600^2 .
It is an emirp because it is prime and its reverse (1466366131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1316636641 - 29 = 1316636129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1316636641.
It is not a weakly prime, because it can be changed into another prime (1316639641) 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, 658318320 + 658318321.
It is an arithmetic number, because the mean of its divisors is an integer number (658318321).
Almost surely, 21316636641 is an apocalyptic number.
It is an amenable number.
1316636641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1316636641 is an equidigital number, since it uses as much as digits as its factorization.
1316636641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 46656, while the sum is 37.
The square root of 1316636641 is about 36285.4880220730. The cubic root of 1316636641 is about 1096.0288325238.
The spelling of 1316636641 in words is "one billion, three hundred sixteen million, six hundred thirty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •