Base | Representation |
---|---|
bin | 101111111101111110… |
… | …0100010101111011001 |
3 | 100211220000202011001012 |
4 | 1133323330202233121 |
5 | 3141431331344321 |
6 | 115153411303305 |
7 | 10304466516065 |
oct | 1377374425731 |
9 | 324800664035 |
10 | 103011199961 |
11 | 3a76115620a |
12 | 17b6a2aab35 |
13 | 9938615a77 |
14 | 4db2d40aa5 |
15 | 2a2d79205b |
hex | 17fbf22bd9 |
103011199961 has 2 divisors, whose sum is σ = 103011199962. Its totient is φ = 103011199960.
The previous prime is 103011199897. The next prime is 103011200051. The reversal of 103011199961 is 169991110301.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 62891109961 + 40120090000 = 250781^2 + 200300^2 .
It is a cyclic number.
It is not a de Polignac number, because 103011199961 - 26 = 103011199897 is a prime.
It is a super-2 number, since 2×1030111999612 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103011199261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51505599980 + 51505599981.
It is an arithmetic number, because the mean of its divisors is an integer number (51505599981).
Almost surely, 2103011199961 is an apocalyptic number.
It is an amenable number.
103011199961 is a deficient number, since it is larger than the sum of its proper divisors (1).
103011199961 is an equidigital number, since it uses as much as digits as its factorization.
103011199961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13122, while the sum is 41.
The spelling of 103011199961 in words is "one hundred three billion, eleven million, one hundred ninety-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •