Base | Representation |
---|---|
bin | 1100000101010… |
… | …1011001001100 |
3 | 10112100212211122 |
4 | 3001111121030 |
5 | 100433301140 |
6 | 5010140112 |
7 | 1153533146 |
oct | 301253114 |
9 | 115325748 |
10 | 50681420 |
11 | 26676779 |
12 | 14b81638 |
13 | a66660a |
14 | 6a33c96 |
15 | 46b1ab5 |
hex | 305564c |
50681420 has 48 divisors (see below), whose sum is σ = 117609408. Its totient is φ = 18247680.
The previous prime is 50681387. The next prime is 50681429. The reversal of 50681420 is 2418605.
It is a self number, because there is not a number n which added to its sum of digits gives 50681420.
It is not an unprimeable number, because it can be changed into a prime (50681429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4580 + ... + 11060.
It is an arithmetic number, because the mean of its divisors is an integer number (2450196).
Almost surely, 250681420 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 50681420, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58804704).
50681420 is an abundant number, since it is smaller than the sum of its proper divisors (66927988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50681420 is a wasteful number, since it uses less digits than its factorization.
50681420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6530 (or 6528 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 26.
The square root of 50681420 is about 7119.0884247915. The cubic root of 50681420 is about 370.0691859908.
The spelling of 50681420 in words is "fifty million, six hundred eighty-one thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •