Base | Representation |
---|---|
bin | 110000001011111010… |
… | …0011001100001011111 |
3 | 100220002121200001212222 |
4 | 1200113310121201133 |
5 | 3143411034431403 |
6 | 115312034215555 |
7 | 10322205342401 |
oct | 1402764314137 |
9 | 326077601788 |
10 | 103478827103 |
11 | 3a981111423 |
12 | 1807aa245bb |
13 | 99b1474b12 |
14 | 50190aab71 |
15 | 2a59863338 |
hex | 1817d1985f |
103478827103 has 4 divisors (see below), whose sum is σ = 103479924528. Its totient is φ = 103477729680.
The previous prime is 103478827079. The next prime is 103478827163. The reversal of 103478827103 is 301728874301.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 103478827103 - 210 = 103478826079 is a prime.
It is a super-2 number, since 2×1034788271032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103478827163) 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 3 ways as a sum of consecutive naturals, for example, 392438 + ... + 600803.
It is an arithmetic number, because the mean of its divisors is an integer number (25869981132).
Almost surely, 2103478827103 is an apocalyptic number.
103478827103 is a deficient number, since it is larger than the sum of its proper divisors (1097425).
103478827103 is an equidigital number, since it uses as much as digits as its factorization.
103478827103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1097424.
The product of its (nonzero) digits is 225792, while the sum is 44.
The spelling of 103478827103 in words is "one hundred three billion, four hundred seventy-eight million, eight hundred twenty-seven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •