Base | Representation |
---|---|
bin | 101111111101111110… |
… | …0010001111110100011 |
3 | 100211220000121122212011 |
4 | 1133323330101332203 |
5 | 3141431322200144 |
6 | 115153410013351 |
7 | 10304466111646 |
oct | 1377374217643 |
9 | 324800548764 |
10 | 103011131299 |
11 | 3a76110966a |
12 | 17b6a277257 |
13 | 99385c073b |
14 | 4db2d23a5d |
15 | 2a2d77ba34 |
hex | 17fbf11fa3 |
103011131299 has 2 divisors, whose sum is σ = 103011131300. Its totient is φ = 103011131298.
The previous prime is 103011131281. The next prime is 103011131323. The reversal of 103011131299 is 992131110301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103011131299 - 229 = 102474260387 is a prime.
It is a super-2 number, since 2×1030111312992 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103011131299.
It is not a weakly prime, because it can be changed into another prime (103011111299) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51505565649 + 51505565650.
It is an arithmetic number, because the mean of its divisors is an integer number (51505565650).
Almost surely, 2103011131299 is an apocalyptic number.
103011131299 is a deficient number, since it is larger than the sum of its proper divisors (1).
103011131299 is an equidigital number, since it uses as much as digits as its factorization.
103011131299 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 31.
The spelling of 103011131299 in words is "one hundred three billion, eleven million, one hundred thirty-one thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •