Base | Representation |
---|---|
bin | 110000000001100110… |
… | …1001011110101101001 |
3 | 100212012111221101120001 |
4 | 1200003031023311221 |
5 | 3142204022044423 |
6 | 115213442103001 |
7 | 10310506030240 |
oct | 1400315136551 |
9 | 325174841501 |
10 | 103133003113 |
11 | 3a813989778 |
12 | 17ba304aa61 |
13 | 995792163a |
14 | 4dc51a9957 |
15 | 2a39301cad |
hex | 180334bd69 |
103133003113 has 8 divisors (see below), whose sum is σ = 118617031232. Its totient is φ = 87836660496.
The previous prime is 103133003081. The next prime is 103133003117. The reversal of 103133003113 is 311300331301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103133003113 - 25 = 103133003081 is a prime.
It is a super-2 number, since 2×1031330031132 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103133003117) 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, 46920195 + ... + 46922392.
It is an arithmetic number, because the mean of its divisors is an integer number (14827128904).
Almost surely, 2103133003113 is an apocalyptic number.
It is an amenable number.
103133003113 is a deficient number, since it is larger than the sum of its proper divisors (15484028119).
103133003113 is an equidigital number, since it uses as much as digits as its factorization.
103133003113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93842751.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 103133003113 its reverse (311300331301), we get a palindrome (414433334414).
The spelling of 103133003113 in words is "one hundred three billion, one hundred thirty-three million, three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •