Base | Representation |
---|---|
bin | 10111011111011001111010… |
… | …101001110110101011011011 |
3 | 111112210122102121202201201012 |
4 | 113133121322221312223123 |
5 | 102020140413442131303 |
6 | 1003421232425244135 |
7 | 30522063302112041 |
oct | 2737317251665333 |
9 | 445718377681635 |
10 | 103313201130203 |
11 | 2aa11978739709 |
12 | b70695a03364b |
13 | 4585515737c9c |
14 | 1b725581b0391 |
15 | be26306035d8 |
hex | 5df67aa76adb |
103313201130203 has 2 divisors, whose sum is σ = 103313201130204. Its totient is φ = 103313201130202.
The previous prime is 103313201130193. The next prime is 103313201130241. The reversal of 103313201130203 is 302031102313301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103313201130203 - 220 = 103313200081627 is a prime.
It is a super-4 number, since 4×1033132011302034 (a number of 57 digits) contains 4444 as substring.
It is not a weakly prime, because it can be changed into another prime (103313201120203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51656600565101 + 51656600565102.
It is an arithmetic number, because the mean of its divisors is an integer number (51656600565102).
Almost surely, 2103313201130203 is an apocalyptic number.
103313201130203 is a deficient number, since it is larger than the sum of its proper divisors (1).
103313201130203 is an equidigital number, since it uses as much as digits as its factorization.
103313201130203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 103313201130203 its reverse (302031102313301), we get a palindrome (405344303443504).
The spelling of 103313201130203 in words is "one hundred three trillion, three hundred thirteen billion, two hundred one million, one hundred thirty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •