Base | Representation |
---|---|
bin | 110000001000011111… |
… | …0011110000100110001 |
3 | 100212210121122121022012 |
4 | 1200100332132010301 |
5 | 3143142142323143 |
6 | 115252413452305 |
7 | 10316312505305 |
oct | 1402076360461 |
9 | 325717577265 |
10 | 103364026673 |
11 | 3a922331136 |
12 | 180484a1095 |
13 | 999374b77b |
14 | 5007b45d05 |
15 | 2a4e738418 |
hex | 1810f9e131 |
103364026673 has 2 divisors, whose sum is σ = 103364026674. Its totient is φ = 103364026672.
The previous prime is 103364026663. The next prime is 103364026681. The reversal of 103364026673 is 376620463301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103331388304 + 32638369 = 321452^2 + 5713^2 .
It is an emirp because it is prime and its reverse (376620463301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103364026673 - 214 = 103364010289 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 103364026673.
It is not a weakly prime, because it can be changed into another prime (103364026643) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51682013336 + 51682013337.
It is an arithmetic number, because the mean of its divisors is an integer number (51682013337).
Almost surely, 2103364026673 is an apocalyptic number.
It is an amenable number.
103364026673 is a deficient number, since it is larger than the sum of its proper divisors (1).
103364026673 is an equidigital number, since it uses as much as digits as its factorization.
103364026673 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 326592, while the sum is 41.
Adding to 103364026673 its reverse (376620463301), we get a palindrome (479984489974).
The spelling of 103364026673 in words is "one hundred three billion, three hundred sixty-four million, twenty-six thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •