Base | Representation |
---|---|
bin | 10111011100010100100100… |
… | …100000000101001100010101 |
3 | 111112001101111000210101001220 |
4 | 113130110210200011030111 |
5 | 102003202431344031013 |
6 | 1003140030122440553 |
7 | 30500552246041602 |
oct | 2734244440051425 |
9 | 445041430711056 |
10 | 103101302330133 |
11 | 2a940020357948 |
12 | b691881663159 |
13 | 456b546228013 |
14 | 1b661b5ad56a9 |
15 | bdbd7c74db23 |
hex | 5dc524805315 |
103101302330133 has 16 divisors (see below), whose sum is σ = 137854693416960. Its totient is φ = 68541065760816.
The previous prime is 103101302330057. The next prime is 103101302330137. The reversal of 103101302330133 is 331033203101301.
It is not a de Polignac number, because 103101302330133 - 212 = 103101302326037 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103101302330137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43704516 + ... + 46003122.
It is an arithmetic number, because the mean of its divisors is an integer number (8615918338560).
Almost surely, 2103101302330133 is an apocalyptic number.
It is an amenable number.
103101302330133 is a deficient number, since it is larger than the sum of its proper divisors (34753391086827).
103101302330133 is a wasteful number, since it uses less digits than its factorization.
103101302330133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2340616.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 103101302330133 its reverse (331033203101301), we get a palindrome (434134505431434).
The spelling of 103101302330133 in words is "one hundred three trillion, one hundred one billion, three hundred two million, three hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •