Base | Representation |
---|---|
bin | 11000010000000111… |
… | …10000000101110011 |
3 | 1020121101121202122001 |
4 | 30020003300011303 |
5 | 203131121244102 |
6 | 5551545554431 |
7 | 640436023021 |
oct | 141003600563 |
9 | 36541552561 |
10 | 13020103027 |
11 | 5581566128 |
12 | 26344a5a17 |
13 | 12c65bcc99 |
14 | 8b72bd711 |
15 | 5130c3487 |
hex | 3080f0173 |
13020103027 has 2 divisors, whose sum is σ = 13020103028. Its totient is φ = 13020103026.
The previous prime is 13020103007. The next prime is 13020103081. The reversal of 13020103027 is 72030102031.
It is a weak prime.
It is an emirp because it is prime and its reverse (72030102031) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13020103027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13020102995 and 13020103013.
It is not a weakly prime, because it can be changed into another prime (13020103007) 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, 6510051513 + 6510051514.
It is an arithmetic number, because the mean of its divisors is an integer number (6510051514).
Almost surely, 213020103027 is an apocalyptic number.
13020103027 is a deficient number, since it is larger than the sum of its proper divisors (1).
13020103027 is an equidigital number, since it uses as much as digits as its factorization.
13020103027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 19.
Adding to 13020103027 its reverse (72030102031), we get a palindrome (85050205058).
The spelling of 13020103027 in words is "thirteen billion, twenty million, one hundred three thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •