Base | Representation |
---|---|
bin | 11001000000010001… |
… | …00010011100011101 |
3 | 1021122112122102020222 |
4 | 30200020202130131 |
5 | 204443021323122 |
6 | 10100015051125 |
7 | 653442132263 |
oct | 144010423435 |
9 | 37575572228 |
10 | 13424011037 |
11 | 57695601a8 |
12 | 2727810aa5 |
13 | 135c19c2c8 |
14 | 914bc0433 |
15 | 5387a9b42 |
hex | 32022271d |
13424011037 has 2 divisors, whose sum is σ = 13424011038. Its totient is φ = 13424011036.
The previous prime is 13424011009. The next prime is 13424011039. The reversal of 13424011037 is 73011042431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7039042201 + 6384968836 = 83899^2 + 79906^2 .
It is a cyclic number.
It is not a de Polignac number, because 13424011037 - 230 = 12350269213 is a prime.
Together with 13424011039, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 13424010997 and 13424011015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13424011039) 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 as a sum of consecutive naturals, namely, 6712005518 + 6712005519.
It is an arithmetic number, because the mean of its divisors is an integer number (6712005519).
Almost surely, 213424011037 is an apocalyptic number.
It is an amenable number.
13424011037 is a deficient number, since it is larger than the sum of its proper divisors (1).
13424011037 is an equidigital number, since it uses as much as digits as its factorization.
13424011037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 13424011037 its reverse (73011042431), we get a palindrome (86435053468).
The spelling of 13424011037 in words is "thirteen billion, four hundred twenty-four million, eleven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •