Base | Representation |
---|---|
bin | 101111111101110000… |
… | …1001101000110100001 |
3 | 100211212112021001102112 |
4 | 1133323201031012201 |
5 | 3141423013032231 |
6 | 115152553525105 |
7 | 10304351560331 |
oct | 1377341150641 |
9 | 324775231375 |
10 | 103004033441 |
11 | 3a758100971 |
12 | 17b67a13795 |
13 | 9936ca6b1a |
14 | 4db1dd70c1 |
15 | 2a2cd2892b |
hex | 17fb84d1a1 |
103004033441 has 2 divisors, whose sum is σ = 103004033442. Its totient is φ = 103004033440.
The previous prime is 103004033393. The next prime is 103004033443. The reversal of 103004033441 is 144330400301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102537646225 + 466387216 = 320215^2 + 21596^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103004033441 is a prime.
It is a super-2 number, since 2×1030040334412 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 103004033443, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (103004033443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51502016720 + 51502016721.
It is an arithmetic number, because the mean of its divisors is an integer number (51502016721).
Almost surely, 2103004033441 is an apocalyptic number.
It is an amenable number.
103004033441 is a deficient number, since it is larger than the sum of its proper divisors (1).
103004033441 is an equidigital number, since it uses as much as digits as its factorization.
103004033441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 103004033441 its reverse (144330400301), we get a palindrome (247334433742).
The spelling of 103004033441 in words is "one hundred three billion, four million, thirty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •