Base | Representation |
---|---|
bin | 10111011011001001010100… |
… | …111011110111011011101110 |
3 | 111111202122221111210021022212 |
4 | 113123021110323313123232 |
5 | 102000342001144312200 |
6 | 1003034545202210422 |
7 | 30461662201133510 |
oct | 2733112473673356 |
9 | 444678844707285 |
10 | 103020510541550 |
11 | 2a909831509338 |
12 | b67a094653a12 |
13 | 4563a3c056a64 |
14 | 1b6230db2bbb0 |
15 | bd9bee9cb035 |
hex | 5db254ef76ee |
103020510541550 has 48 divisors (see below), whose sum is σ = 222582206615712. Its totient is φ = 34742279894400.
The previous prime is 103020510541517. The next prime is 103020510541561. The reversal of 103020510541550 is 55145015020301.
It is a super-2 number, since 2×1030205105415502 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2412636977 + ... + 2412679676.
It is an arithmetic number, because the mean of its divisors is an integer number (4637129304494).
Almost surely, 2103020510541550 is an apocalyptic number.
103020510541550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103020510541550 is an abundant number, since it is smaller than the sum of its proper divisors (119561696074162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103020510541550 is a wasteful number, since it uses less digits than its factorization.
103020510541550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4825316733 (or 4825316728 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 32.
Adding to 103020510541550 its reverse (55145015020301), we get a palindrome (158165525561851).
The spelling of 103020510541550 in words is "one hundred three trillion, twenty billion, five hundred ten million, five hundred forty-one thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •