Base | Representation |
---|---|
bin | 101110101010001100… |
… | …101111000101001110 |
3 | 11210022120012001121211 |
4 | 232222030233011032 |
5 | 1310101111334200 |
6 | 35003215045034 |
7 | 3422345604445 |
oct | 565214570516 |
9 | 153276161554 |
10 | 50100105550 |
11 | 1a27a226910 |
12 | 986251077a |
13 | 495571c591 |
14 | 25d3b4bd5c |
15 | 148356aaba |
hex | baa32f14e |
50100105550 has 48 divisors (see below), whose sum is σ = 101688027264. Its totient is φ = 18212780000.
The previous prime is 50100105541. The next prime is 50100105577. The reversal of 50100105550 is 5550100105.
It is a super-2 number, since 2×501001055502 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 2139405 + ... + 2162695.
It is an arithmetic number, because the mean of its divisors is an integer number (2118500568).
Almost surely, 250100105550 is an apocalyptic number.
50100105550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50100105550 is an abundant number, since it is smaller than the sum of its proper divisors (51587921714).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50100105550 is a wasteful number, since it uses less digits than its factorization.
50100105550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27225 (or 27220 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 22.
Adding to 50100105550 its reverse (5550100105), we get a palindrome (55650205655).
The spelling of 50100105550 in words is "fifty billion, one hundred million, one hundred five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •