Base | Representation |
---|---|
bin | 101111111111010010… |
… | …0000001000011010011 |
3 | 100212000002100121112200 |
4 | 1133332210001003103 |
5 | 3142024101232123 |
6 | 115202020254243 |
7 | 10305541625616 |
oct | 1377644010323 |
9 | 325002317480 |
10 | 103055102163 |
11 | 3a783a11622 |
12 | 17b80b41383 |
13 | 99447477c0 |
14 | 4db8acc17d |
15 | 2a32565143 |
hex | 17fe9010d3 |
103055102163 has 12 divisors (see below), whose sum is σ = 160307936880. Its totient is φ = 63418524336.
The previous prime is 103055102153. The next prime is 103055102167. The reversal of 103055102163 is 361201550301.
103055102163 is a `hidden beast` number, since 1 + 0 + 30 + 551 + 0 + 21 + 63 = 666.
It is not a de Polignac number, because 103055102163 - 210 = 103055101139 is a prime.
It is not an unprimeable number, because it can be changed into a prime (103055102167) 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 11 ways as a sum of consecutive naturals, for example, 440406303 + ... + 440406536.
It is an arithmetic number, because the mean of its divisors is an integer number (13358994740).
Almost surely, 2103055102163 is an apocalyptic number.
103055102163 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
103055102163 is a deficient number, since it is larger than the sum of its proper divisors (57252834717).
103055102163 is a wasteful number, since it uses less digits than its factorization.
103055102163 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880812858 (or 880812855 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
Adding to 103055102163 its reverse (361201550301), we get a palindrome (464256652464).
The spelling of 103055102163 in words is "one hundred three billion, fifty-five million, one hundred two thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •