Base | Representation |
---|---|
bin | 1100000000110… |
… | …0000000001100 |
3 | 10111210121111000 |
4 | 3000030000030 |
5 | 100344141222 |
6 | 4555500300 |
7 | 1151141556 |
oct | 300140014 |
9 | 114717430 |
10 | 50380812 |
11 | 26490939 |
12 | 14a57690 |
13 | a58c841 |
14 | 69964d6 |
15 | 46529ac |
hex | 300c00c |
50380812 has 36 divisors (see below), whose sum is σ = 130808440. Its totient is φ = 16769016.
The previous prime is 50380789. The next prime is 50380823. The reversal of 50380812 is 21808305.
It is a happy number.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
50380812 is a `hidden beast` number, since 503 + 80 + 81 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a zygodrome in base 2.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 73423 + ... + 74105.
Almost surely, 250380812 is an apocalyptic number.
It is an amenable number.
50380812 is an abundant number, since it is smaller than the sum of its proper divisors (80427628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50380812 is an equidigital number, since it uses as much as digits as its factorization.
50380812 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1379 (or 688 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 50380812 is about 7097.9442094173. The cubic root of 50380812 is about 369.3360676841.
Multiplying 50380812 by its sum of digits (27), we get a square (1360281924 = 368822).
50380812 divided by its sum of digits (27) gives a square (1865956 = 13662).
The spelling of 50380812 in words is "fifty million, three hundred eighty thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •