Base | Representation |
---|---|
bin | 1011111111010… |
… | …1010110001101 |
3 | 10111121220012000 |
4 | 2333311112031 |
5 | 100333204023 |
6 | 4553502513 |
7 | 1150304166 |
oct | 277652615 |
9 | 114556160 |
10 | 50288013 |
11 | 26428146 |
12 | 14a11a39 |
13 | a559529 |
14 | 697076d |
15 | 4635243 |
hex | 2ff558d |
50288013 has 8 divisors (see below), whose sum is σ = 74500800. Its totient is φ = 33525324.
The previous prime is 50288009. The next prime is 50288033. The reversal of 50288013 is 31088205.
It is a happy number.
It is not a de Polignac number, because 50288013 - 22 = 50288009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1862519 = 50288013 / (5 + 0 + 2 + 8 + 8 + 0 + 1 + 3).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50288033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 931233 + ... + 931286.
It is an arithmetic number, because the mean of its divisors is an integer number (9312600).
Almost surely, 250288013 is an apocalyptic number.
It is an amenable number.
50288013 is a deficient number, since it is larger than the sum of its proper divisors (24212787).
50288013 is a wasteful number, since it uses less digits than its factorization.
50288013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1862528 (or 1862522 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 50288013 is about 7091.4041627875. The cubic root of 50288013 is about 369.1091619659.
It can be divided in two parts, 5028 and 8013, that added together give a triangular number (13041 = T161).
The spelling of 50288013 in words is "fifty million, two hundred eighty-eight thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •