Base | Representation |
---|---|
bin | 10111011110100100001101… |
… | …011101010011101111110101 |
3 | 111112121010120201220221011121 |
4 | 113132210031131103233311 |
5 | 102013214313321100010 |
6 | 1003334534314303541 |
7 | 30514652255216365 |
oct | 2736441535235765 |
9 | 445533521827147 |
10 | 103255534550005 |
11 | 2a99a476429472 |
12 | b6b7745727bb1 |
13 | 457cc55554696 |
14 | 1b6d8475a89a5 |
15 | be0da7b743da |
hex | 5de90d753bf5 |
103255534550005 has 4 divisors (see below), whose sum is σ = 123906641460012. Its totient is φ = 82604427640000.
The previous prime is 103255534549949. The next prime is 103255534550033. The reversal of 103255534550005 is 500055435552301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 62868263960401 + 40387270589604 = 7928951^2 + 6355098^2 .
It is not a de Polignac number, because 103255534550005 - 215 = 103255534517237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10325553454996 + ... + 10325553455005.
It is an arithmetic number, because the mean of its divisors is an integer number (30976660365003).
Almost surely, 2103255534550005 is an apocalyptic number.
It is an amenable number.
103255534550005 is a deficient number, since it is larger than the sum of its proper divisors (20651106910007).
103255534550005 is an equidigital number, since it uses as much as digits as its factorization.
103255534550005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20651106910006.
The product of its (nonzero) digits is 1125000, while the sum is 43.
The spelling of 103255534550005 in words is "one hundred three trillion, two hundred fifty-five billion, five hundred thirty-four million, five hundred fifty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •