Base | Representation |
---|---|
bin | 10011010001001000011… |
… | …000101101001001100011 |
3 | 11200120122022200202111211 |
4 | 103101020120231021203 |
5 | 133143140434104412 |
6 | 2452133342250551 |
7 | 164442356250403 |
oct | 23211030551143 |
9 | 4616568622454 |
10 | 1324064363107 |
11 | 4705948a6392 |
12 | 194742586a57 |
13 | 97b2183a655 |
14 | 4812957a803 |
15 | 246968cbca7 |
hex | 1344862d263 |
1324064363107 has 2 divisors, whose sum is σ = 1324064363108. Its totient is φ = 1324064363106.
The previous prime is 1324064363093. The next prime is 1324064363161. The reversal of 1324064363107 is 7013634604231.
It is a weak prime.
It is an emirp because it is prime and its reverse (7013634604231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1324064363107 - 235 = 1289704624739 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1324064363107.
It is not a weakly prime, because it can be changed into another prime (1324064364107) 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, 662032181553 + 662032181554.
It is an arithmetic number, because the mean of its divisors is an integer number (662032181554).
Almost surely, 21324064363107 is an apocalyptic number.
1324064363107 is a deficient number, since it is larger than the sum of its proper divisors (1).
1324064363107 is an equidigital number, since it uses as much as digits as its factorization.
1324064363107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728, while the sum is 40.
Adding to 1324064363107 its reverse (7013634604231), we get a palindrome (8337698967338).
The spelling of 1324064363107 in words is "one trillion, three hundred twenty-four billion, sixty-four million, three hundred sixty-three thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •