Base | Representation |
---|---|
bin | 1100000001100000110111… |
… | …0011111010100010101011 |
3 | 1201210211111100201120021201 |
4 | 3000120031303322202223 |
5 | 3213044322102100102 |
6 | 44041125435145031 |
7 | 2533060263555022 |
oct | 300301563724253 |
9 | 51724440646251 |
10 | 13220141050027 |
11 | 42376a2a7998a |
12 | 159619a5a5177 |
13 | 74b866969472 |
14 | 339c030278b9 |
15 | 17dd45e39987 |
hex | c060dcfa8ab |
13220141050027 has 2 divisors, whose sum is σ = 13220141050028. Its totient is φ = 13220141050026.
The previous prime is 13220141049967. The next prime is 13220141050037. The reversal of 13220141050027 is 72005014102231.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13220141050027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13220141049977 and 13220141050004.
It is not a weakly prime, because it can be changed into another prime (13220141050037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6610070525013 + 6610070525014.
It is an arithmetic number, because the mean of its divisors is an integer number (6610070525014).
Almost surely, 213220141050027 is an apocalyptic number.
13220141050027 is a deficient number, since it is larger than the sum of its proper divisors (1).
13220141050027 is an equidigital number, since it uses as much as digits as its factorization.
13220141050027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 28.
Adding to 13220141050027 its reverse (72005014102231), we get a palindrome (85225155152258).
The spelling of 13220141050027 in words is "thirteen trillion, two hundred twenty billion, one hundred forty-one million, fifty thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •