Base | Representation |
---|---|
bin | 10111100011111110001011… |
… | …000011111010011100011111 |
3 | 111120220122102102122200212222 |
4 | 113203332023003322130133 |
5 | 102040311103301300224 |
6 | 1004221331333215555 |
7 | 30553542613063166 |
oct | 2743761303723437 |
9 | 446818372580788 |
10 | 103627009009439 |
11 | 30022a71042a53 |
12 | b7577377915bb |
13 | 45a8ca6119926 |
14 | 1b838070983dd |
15 | bea89a0e5b5e |
hex | 5e3f8b0fa71f |
103627009009439 has 2 divisors, whose sum is σ = 103627009009440. Its totient is φ = 103627009009438.
The previous prime is 103627009009417. The next prime is 103627009009441. The reversal of 103627009009439 is 934900900726301.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103627009009439 - 232 = 103622714042143 is a prime.
It is a super-3 number, since 3×1036270090094393 (a number of 43 digits) contains 333 as substring.
Together with 103627009009441, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103627009009499) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51813504504719 + 51813504504720.
It is an arithmetic number, because the mean of its divisors is an integer number (51813504504720).
Almost surely, 2103627009009439 is an apocalyptic number.
103627009009439 is a deficient number, since it is larger than the sum of its proper divisors (1).
103627009009439 is an equidigital number, since it uses as much as digits as its factorization.
103627009009439 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2204496, while the sum is 53.
The spelling of 103627009009439 in words is "one hundred three trillion, six hundred twenty-seven billion, nine million, nine thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •