Base | Representation |
---|---|
bin | 101110111000110100… |
… | …101010101011100001 |
3 | 11210221122212001211202 |
4 | 232320310222223201 |
5 | 1311101414014210 |
6 | 35043421450545 |
7 | 3431415205106 |
oct | 567064525341 |
9 | 153848761752 |
10 | 50345454305 |
11 | 1a395772a83 |
12 | 9910710a55 |
13 | 49944c3b63 |
14 | 2618576aad |
15 | 1499d819a5 |
hex | bb8d2aae1 |
50345454305 has 4 divisors (see below), whose sum is σ = 60414545172. Its totient is φ = 40276363440.
The previous prime is 50345454301. The next prime is 50345454319.
50345454305 is nontrivially palindromic in base 10.
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 23538923776 + 26806530529 = 153424^2 + 163727^2 .
It is not a de Polignac number, because 50345454305 - 22 = 50345454301 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50345454301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5034545426 + ... + 5034545435.
It is an arithmetic number, because the mean of its divisors is an integer number (15103636293).
Almost surely, 250345454305 is an apocalyptic number.
It is an amenable number.
50345454305 is a deficient number, since it is larger than the sum of its proper divisors (10069090867).
50345454305 is a wasteful number, since it uses less digits than its factorization.
50345454305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10069090866.
The product of its (nonzero) digits is 360000, while the sum is 38.
The spelling of 50345454305 in words is "fifty billion, three hundred forty-five million, four hundred fifty-four thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •