Base | Representation |
---|---|
bin | 101111111110111011… |
… | …1011010100010100001 |
3 | 100211222021100121000121 |
4 | 1133331313122202201 |
5 | 3142013103110311 |
6 | 115200521520241 |
7 | 10305340351123 |
oct | 1377567324241 |
9 | 324867317017 |
10 | 103043410081 |
11 | 3a778356147 |
12 | 17b79043081 |
13 | 99421b2a01 |
14 | 4db7327213 |
15 | 2a31505b71 |
hex | 17fddda8a1 |
103043410081 has 2 divisors, whose sum is σ = 103043410082. Its totient is φ = 103043410080.
The previous prime is 103043410079. The next prime is 103043410159. The reversal of 103043410081 is 180014340301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75620050081 + 27423360000 = 274991^2 + 165600^2 .
It is a cyclic number.
It is not a de Polignac number, because 103043410081 - 21 = 103043410079 is a prime.
It is a super-2 number, since 2×1030434100812 (a number of 23 digits) contains 22 as substring.
Together with 103043410079, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (103043110081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51521705040 + 51521705041.
It is an arithmetic number, because the mean of its divisors is an integer number (51521705041).
Almost surely, 2103043410081 is an apocalyptic number.
It is an amenable number.
103043410081 is a deficient number, since it is larger than the sum of its proper divisors (1).
103043410081 is an equidigital number, since it uses as much as digits as its factorization.
103043410081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 103043410081 its reverse (180014340301), we get a palindrome (283057750382).
The spelling of 103043410081 in words is "one hundred three billion, forty-three million, four hundred ten thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •