Base | Representation |
---|---|
bin | 110100000000001011… |
… | …011010010001100010 |
3 | 12100010102020020210212 |
4 | 310000023122101202 |
5 | 1403323404103200 |
6 | 41352412454122 |
7 | 4014464323520 |
oct | 640013322142 |
9 | 170112206725 |
10 | 55837566050 |
11 | 21753939902 |
12 | a9a3a7a342 |
13 | 535b2a5216 |
14 | 29b9b39310 |
15 | 16bc0e4035 |
hex | d002da462 |
55837566050 has 24 divisors (see below), whose sum is σ = 118694712576. Its totient is φ = 19144308240.
The previous prime is 55837566013. The next prime is 55837566119. The reversal of 55837566050 is 5066573855.
It is a super-2 number, since 2×558375660502 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a self number, because there is not a number n which added to its sum of digits gives 55837566050.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 79767602 + ... + 79768301.
It is an arithmetic number, because the mean of its divisors is an integer number (4945613024).
Almost surely, 255837566050 is an apocalyptic number.
55837566050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
55837566050 is an abundant number, since it is smaller than the sum of its proper divisors (62857146526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55837566050 is a wasteful number, since it uses less digits than its factorization.
55837566050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159535922 (or 159535917 counting only the distinct ones).
The product of its (nonzero) digits is 3780000, while the sum is 50.
The spelling of 55837566050 in words is "fifty-five billion, eight hundred thirty-seven million, five hundred sixty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •