Base | Representation |
---|---|
bin | 101110111111010111… |
… | …000101011011101001 |
3 | 11211020022020200102121 |
4 | 232333113011123221 |
5 | 1311313003440243 |
6 | 35102340431241 |
7 | 3434216420512 |
oct | 567727053351 |
9 | 154208220377 |
10 | 50455140073 |
11 | 1a44167a578 |
12 | 99413a8521 |
13 | 49b1149190 |
14 | 2628d69a09 |
15 | 14a47eb1ed |
hex | bbf5c56e9 |
50455140073 has 4 divisors (see below), whose sum is σ = 54336304708. Its totient is φ = 46573975440.
The previous prime is 50455140019. The next prime is 50455140077. The reversal of 50455140073 is 37004155405.
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 32404680169 + 18050459904 = 180013^2 + 134352^2 .
It is a cyclic number.
It is not a de Polignac number, because 50455140073 - 229 = 49918269161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50455140077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1940582298 + ... + 1940582323.
It is an arithmetic number, because the mean of its divisors is an integer number (13584076177).
Almost surely, 250455140073 is an apocalyptic number.
It is an amenable number.
50455140073 is a deficient number, since it is larger than the sum of its proper divisors (3881164635).
50455140073 is a wasteful number, since it uses less digits than its factorization.
50455140073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3881164634.
The product of its (nonzero) digits is 42000, while the sum is 34.
Adding to 50455140073 its reverse (37004155405), we get a palindrome (87459295478).
The spelling of 50455140073 in words is "fifty billion, four hundred fifty-five million, one hundred forty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •