Base | Representation |
---|---|
bin | 101110110100100001… |
… | …000101000011000000 |
3 | 11210202121220201001111 |
4 | 232310201011003000 |
5 | 1310424420214220 |
6 | 35032321213104 |
7 | 3426550144666 |
oct | 566441050300 |
9 | 153677821044 |
10 | 50273210560 |
11 | 1a358a0a201 |
12 | 98b0491194 |
13 | 498254ac91 |
14 | 260cb2cc36 |
15 | 149386115a |
hex | bb48450c0 |
50273210560 has 112 divisors (see below), whose sum is σ = 128011428000. Its totient is φ = 18738790400.
The previous prime is 50273210551. The next prime is 50273210567. The reversal of 50273210560 is 6501237205.
It is not an unprimeable number, because it can be changed into a prime (50273210567) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 503691 + ... + 595189.
Almost surely, 250273210560 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50273210560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64005714000).
50273210560 is an abundant number, since it is smaller than the sum of its proper divisors (77738217440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50273210560 is a wasteful number, since it uses less digits than its factorization.
50273210560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91634 (or 91624 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 31.
Adding to 50273210560 its reverse (6501237205), we get a palindrome (56774447765).
The spelling of 50273210560 in words is "fifty billion, two hundred seventy-three million, two hundred ten thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •