Base | Representation |
---|---|
bin | 101111111101101111… |
… | …0000100010011110101 |
3 | 100211212110201021020122 |
4 | 1133323132010103311 |
5 | 3141422310222442 |
6 | 115152524141325 |
7 | 10304341563461 |
oct | 1377336042365 |
9 | 324773637218 |
10 | 103003210997 |
11 | 3a757699a65 |
12 | 17b67697845 |
13 | 9936a7967b |
14 | 4db1c614a1 |
15 | 2a2cc14dd2 |
hex | 17fb7844f5 |
103003210997 has 2 divisors, whose sum is σ = 103003210998. Its totient is φ = 103003210996.
The previous prime is 103003210993. The next prime is 103003211023. The reversal of 103003210997 is 799012300301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 66674469796 + 36328741201 = 258214^2 + 190601^2 .
It is an emirp because it is prime and its reverse (799012300301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103003210997 - 22 = 103003210993 is a prime.
It is a super-2 number, since 2×1030032109972 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103003210991) 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, 51501605498 + 51501605499.
It is an arithmetic number, because the mean of its divisors is an integer number (51501605499).
Almost surely, 2103003210997 is an apocalyptic number.
It is an amenable number.
103003210997 is a deficient number, since it is larger than the sum of its proper divisors (1).
103003210997 is an equidigital number, since it uses as much as digits as its factorization.
103003210997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10206, while the sum is 35.
The spelling of 103003210997 in words is "one hundred three billion, three million, two hundred ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •