Base | Representation |
---|---|
bin | 10110110000101110000010… |
… | …11111110110100101111101 |
3 | 20120012222020210122110011122 |
4 | 23120113001133312211331 |
5 | 23030030010031044203 |
6 | 254241445020000325 |
7 | 13354113421255304 |
oct | 1330270137664575 |
9 | 216188223573148 |
10 | 50052500253053 |
11 | 14a48167588281 |
12 | 57446150900a5 |
13 | 21c0c1348037c |
14 | c507a801343b |
15 | 5bbea8c80538 |
hex | 2d85c17f697d |
50052500253053 has 4 divisors (see below), whose sum is σ = 50131822758048. Its totient is φ = 49973177748060.
The previous prime is 50052500253037. The next prime is 50052500253089. The reversal of 50052500253053 is 35035200525005.
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 50052500253053 - 24 = 50052500253037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50052500253953) 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, 39661251551 + ... + 39661252812.
It is an arithmetic number, because the mean of its divisors is an integer number (12532955689512).
Almost surely, 250052500253053 is an apocalyptic number.
It is an amenable number.
50052500253053 is a deficient number, since it is larger than the sum of its proper divisors (79322504995).
50052500253053 is an equidigital number, since it uses as much as digits as its factorization.
50052500253053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79322504994.
The product of its (nonzero) digits is 112500, while the sum is 35.
Adding to 50052500253053 its reverse (35035200525005), we get a palindrome (85087700778058).
The spelling of 50052500253053 in words is "fifty trillion, fifty-two billion, five hundred million, two hundred fifty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •