Base | Representation |
---|---|
bin | 1100000011010… |
… | …1010011111101 |
3 | 10112010012120201 |
4 | 3000311103331 |
5 | 100420100023 |
6 | 5003243501 |
7 | 1152445063 |
oct | 300652375 |
9 | 115105521 |
10 | 50550013 |
11 | 26596a78 |
12 | 14b19591 |
13 | a61b867 |
14 | 69dc033 |
15 | 4687bad |
hex | 30354fd |
50550013 has 4 divisors (see below), whose sum is σ = 53210560. Its totient is φ = 47889468.
The previous prime is 50550011. The next prime is 50550023. The reversal of 50550013 is 31005505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50550013 - 21 = 50550011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19), and also a Moran number because the ratio is a prime number: 2660527 = 50550013 / (5 + 0 + 5 + 5 + 0 + 0 + 1 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50550011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1330245 + ... + 1330282.
It is an arithmetic number, because the mean of its divisors is an integer number (13302640).
Almost surely, 250550013 is an apocalyptic number.
It is an amenable number.
50550013 is a deficient number, since it is larger than the sum of its proper divisors (2660547).
50550013 is a wasteful number, since it uses less digits than its factorization.
50550013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2660546.
The product of its (nonzero) digits is 375, while the sum is 19.
The square root of 50550013 is about 7109.8532333657. The cubic root of 50550013 is about 369.7490701821.
Adding to 50550013 its reverse (31005505), we get a palindrome (81555518).
The spelling of 50550013 in words is "fifty million, five hundred fifty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.007 sec. • engine limits •