Base | Representation |
---|---|
bin | 101111111110001111… |
… | …1000010110001010111 |
3 | 100211220122202122012122 |
4 | 1133330133002301113 |
5 | 3141441140302210 |
6 | 115154333210155 |
7 | 10304636424521 |
oct | 1377437026127 |
9 | 324818678178 |
10 | 103020244055 |
11 | 3a766273173 |
12 | 17b7133095b |
13 | 993a4614c1 |
14 | 4db4216a11 |
15 | 2a2e47bb55 |
hex | 17fc7c2c57 |
103020244055 has 4 divisors (see below), whose sum is σ = 123624292872. Its totient is φ = 82416195240.
The previous prime is 103020244043. The next prime is 103020244091. The reversal of 103020244055 is 550442020301.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 550442020301 = 467 ⋅1178676703.
It is not a de Polignac number, because 103020244055 - 214 = 103020227671 is a prime.
It is a super-2 number, since 2×1030202440552 (a number of 23 digits) contains 22 as substring.
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 (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10302024401 + ... + 10302024410.
It is an arithmetic number, because the mean of its divisors is an integer number (30906073218).
Almost surely, 2103020244055 is an apocalyptic number.
103020244055 is a deficient number, since it is larger than the sum of its proper divisors (20604048817).
103020244055 is an equidigital number, since it uses as much as digits as its factorization.
103020244055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20604048816.
The product of its (nonzero) digits is 4800, while the sum is 26.
Adding to 103020244055 its reverse (550442020301), we get a palindrome (653462264356).
The spelling of 103020244055 in words is "one hundred three billion, twenty million, two hundred forty-four thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •