Base | Representation |
---|---|
bin | 10111011011001001111000… |
… | …110111010010001011000011 |
3 | 111111202201111112000121002111 |
4 | 113123021320313102023003 |
5 | 102000344220002221011 |
6 | 1003035125054000151 |
7 | 30462013140514456 |
oct | 2733117067221303 |
9 | 444681445017074 |
10 | 103021113320131 |
11 | 2a90a010794856 |
12 | b67a2224a6057 |
13 | 4563b06bb6286 |
14 | 1b62369bd949d |
15 | bd9c37897121 |
hex | 5db278dd22c3 |
103021113320131 has 2 divisors, whose sum is σ = 103021113320132. Its totient is φ = 103021113320130.
The previous prime is 103021113320119. The next prime is 103021113320143. The reversal of 103021113320131 is 131023311120301.
It is a balanced prime because it is at equal distance from previous prime (103021113320119) and next prime (103021113320143).
It is a cyclic number.
It is not a de Polignac number, because 103021113320131 - 225 = 103021079765699 is a prime.
It is a super-2 number, since 2×1030211133201312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103021113320101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51510556660065 + 51510556660066.
It is an arithmetic number, because the mean of its divisors is an integer number (51510556660066).
Almost surely, 2103021113320131 is an apocalyptic number.
103021113320131 is a deficient number, since it is larger than the sum of its proper divisors (1).
103021113320131 is an equidigital number, since it uses as much as digits as its factorization.
103021113320131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 103021113320131 its reverse (131023311120301), we get a palindrome (234044424440432).
The spelling of 103021113320131 in words is "one hundred three trillion, twenty-one billion, one hundred thirteen million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •