Base | Representation |
---|---|
bin | 110000001000011111… |
… | …0110000111101011011 |
3 | 100212210121210112102011 |
4 | 1200100332300331123 |
5 | 3143142202312102 |
6 | 115252415250351 |
7 | 10316313246652 |
oct | 1402076607533 |
9 | 325717715364 |
10 | 103364104027 |
11 | 3a922384268 |
12 | 180485199b7 |
13 | 9993777a42 |
14 | 5007b66199 |
15 | 2a4e7512d7 |
hex | 1810fb0f5b |
103364104027 has 2 divisors, whose sum is σ = 103364104028. Its totient is φ = 103364104026.
The previous prime is 103364104013. The next prime is 103364104037. The reversal of 103364104027 is 720401463301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103364104027 - 211 = 103364101979 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103364104027.
It is not a weakly prime, because it can be changed into another prime (103364104037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51682052013 + 51682052014.
It is an arithmetic number, because the mean of its divisors is an integer number (51682052014).
Almost surely, 2103364104027 is an apocalyptic number.
103364104027 is a deficient number, since it is larger than the sum of its proper divisors (1).
103364104027 is an equidigital number, since it uses as much as digits as its factorization.
103364104027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 31.
Adding to 103364104027 its reverse (720401463301), we get a palindrome (823765567328).
The spelling of 103364104027 in words is "one hundred three billion, three hundred sixty-four million, one hundred four thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •