Base | Representation |
---|---|
bin | 101110101101001101… |
… | …001000111010111001 |
3 | 11210110002002112211202 |
4 | 232231031020322321 |
5 | 1310202014334113 |
6 | 35012220103545 |
7 | 3423530403503 |
oct | 565515107271 |
9 | 153402075752 |
10 | 50150543033 |
11 | 1a2a5746288 |
12 | 9877394bb5 |
13 | 4962ccbb46 |
14 | 25da71ad73 |
15 | 1487bd0258 |
hex | bad348eb9 |
50150543033 has 4 divisors (see below), whose sum is σ = 51096779748. Its totient is φ = 49204306320.
The previous prime is 50150543029. The next prime is 50150543081. The reversal of 50150543033 is 33034505105.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 35181754624 + 14968788409 = 187568^2 + 122347^2 .
It is a cyclic number.
It is not a de Polignac number, because 50150543033 - 22 = 50150543029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50150542987 and 50150543005.
It is not an unprimeable number, because it can be changed into a prime (50150543083) 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, 473118278 + ... + 473118383.
It is an arithmetic number, because the mean of its divisors is an integer number (12774194937).
Almost surely, 250150543033 is an apocalyptic number.
50150543033 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
50150543033 is a deficient number, since it is larger than the sum of its proper divisors (946236715).
50150543033 is an equidigital number, since it uses as much as digits as its factorization.
50150543033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 946236714.
The product of its (nonzero) digits is 13500, while the sum is 29.
The spelling of 50150543033 in words is "fifty billion, one hundred fifty million, five hundred forty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •