Base | Representation |
---|---|
bin | 101111111110111001… |
… | …1010000101001110101 |
3 | 100211222012022021002202 |
4 | 1133331303100221311 |
5 | 3142012313233023 |
6 | 115200442314245 |
7 | 10305325164032 |
oct | 1377563205165 |
9 | 324865267082 |
10 | 103042321013 |
11 | 3a777781995 |
12 | 17b787b8985 |
13 | 9941bc10a8 |
14 | 4db7122389 |
15 | 2a3138d128 |
hex | 17fdcd0a75 |
103042321013 has 2 divisors, whose sum is σ = 103042321014. Its totient is φ = 103042321012.
The previous prime is 103042320977. The next prime is 103042321037. The reversal of 103042321013 is 310123240301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98399533969 + 4642787044 = 313687^2 + 68138^2 .
It is a cyclic number.
It is not a de Polignac number, because 103042321013 - 28 = 103042320757 is a prime.
It is a super-2 number, since 2×1030423210132 (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 (103042321043) 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, 51521160506 + 51521160507.
It is an arithmetic number, because the mean of its divisors is an integer number (51521160507).
Almost surely, 2103042321013 is an apocalyptic number.
It is an amenable number.
103042321013 is a deficient number, since it is larger than the sum of its proper divisors (1).
103042321013 is an equidigital number, since it uses as much as digits as its factorization.
103042321013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 103042321013 its reverse (310123240301), we get a palindrome (413165561314).
The spelling of 103042321013 in words is "one hundred three billion, forty-two million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •