Base | Representation |
---|---|
bin | 110000000100111111… |
… | …0100100011010100101 |
3 | 100212111102201022211112 |
4 | 1200021332210122211 |
5 | 3142422113042013 |
6 | 115233021114405 |
7 | 10313355503000 |
oct | 1401176443245 |
9 | 325442638745 |
10 | 103246612133 |
11 | 3a872025925 |
12 | 180150b8a05 |
13 | 997531b602 |
14 | 4dd6300537 |
15 | 2a44293ba8 |
hex | 1809fa46a5 |
103246612133 has 8 divisors (see below), whose sum is σ = 120404212800. Its totient is φ = 88497095820.
The previous prime is 103246612033. The next prime is 103246612141. The reversal of 103246612133 is 331216642301.
It is not a de Polignac number, because 103246612133 - 210 = 103246611109 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103246612133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103246612033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 150504923 + ... + 150505608.
It is an arithmetic number, because the mean of its divisors is an integer number (15050526600).
Almost surely, 2103246612133 is an apocalyptic number.
It is an amenable number.
103246612133 is a deficient number, since it is larger than the sum of its proper divisors (17157600667).
103246612133 is an frugal number, since it uses more digits than its factorization.
103246612133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301010552 (or 301010538 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 32.
The spelling of 103246612133 in words is "one hundred three billion, two hundred forty-six million, six hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •