Base | Representation |
---|---|
bin | 1100010010111… |
… | …00101111011111 |
3 | 21012002001220211 |
4 | 12021130233133 |
5 | 202400442234 |
6 | 14122353251 |
7 | 2361451432 |
oct | 611345737 |
9 | 235061824 |
10 | 103140319 |
11 | 53246937 |
12 | 2a65b827 |
13 | 184a2c99 |
14 | d9ab819 |
15 | 90c5164 |
hex | 625cbdf |
103140319 has 8 divisors (see below), whose sum is σ = 105210000. Its totient is φ = 101081472.
The previous prime is 103140293. The next prime is 103140329. The reversal of 103140319 is 913041301.
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 103140319 - 25 = 103140287 is a prime.
It is a super-2 number, since 2×1031403192 = 21275850806843522, which contains 22 as substring.
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 103140319.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103140329) 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, 18087 + ... + 23095.
It is an arithmetic number, because the mean of its divisors is an integer number (13151250).
Almost surely, 2103140319 is an apocalyptic number.
103140319 is a deficient number, since it is larger than the sum of its proper divisors (2069681).
103140319 is an equidigital number, since it uses as much as digits as its factorization.
103140319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5417.
The product of its (nonzero) digits is 324, while the sum is 22.
The square root of 103140319 is about 10155.8022332064. The cubic root of 103140319 is about 468.9675829222.
The spelling of 103140319 in words is "one hundred three million, one hundred forty thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •