Base | Representation |
---|---|
bin | 11001001111010100… |
… | …10110001001010011 |
3 | 1021222100022021102222 |
4 | 30213222112021103 |
5 | 210222340022232 |
6 | 10120330131255 |
7 | 656534524553 |
oct | 144752261123 |
9 | 37870267388 |
10 | 13550314067 |
11 | 5823887574 |
12 | 2761b80b2b |
13 | 137c3c2124 |
14 | 92789b163 |
15 | 544907d12 |
hex | 327a96253 |
13550314067 has 2 divisors, whose sum is σ = 13550314068. Its totient is φ = 13550314066.
The previous prime is 13550314013. The next prime is 13550314079. The reversal of 13550314067 is 76041305531.
13550314067 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (76041305531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13550314067 - 220 = 13549265491 is a prime.
It is a super-2 number, since 2×135503140672 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13550314087) 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, 6775157033 + 6775157034.
It is an arithmetic number, because the mean of its divisors is an integer number (6775157034).
Almost surely, 213550314067 is an apocalyptic number.
13550314067 is a deficient number, since it is larger than the sum of its proper divisors (1).
13550314067 is an equidigital number, since it uses as much as digits as its factorization.
13550314067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37800, while the sum is 35.
Adding to 13550314067 its reverse (76041305531), we get a palindrome (89591619598).
The spelling of 13550314067 in words is "thirteen billion, five hundred fifty million, three hundred fourteen thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •