Search a number
-
+
50453621531 = 329391531729
BaseRepresentation
bin101110111111010001…
…010010101100011011
311211020012101112101022
4232333101102230123
51311312111342111
635102244113055
73434200464335
oct567721225433
9154205345338
1050453621531
111a440832685
12994099578b
1349b0a36c31
142628a92455
1514a45eb2db
hexbbf452b1b

50453621531 has 4 divisors (see below), whose sum is σ = 50455186200. Its totient is φ = 50452056864.

The previous prime is 50453621503. The next prime is 50453621557. The reversal of 50453621531 is 13512635405.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 50453621531 - 222 = 50449427227 is a prime.

It is a super-2 number, since 2×504536215312 (a number of 22 digits) contains 22 as substring.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 50453621491 and 50453621500.

It is not an unprimeable number, because it can be changed into a prime (50453621501) 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, 732926 + ... + 798803.

It is an arithmetic number, because the mean of its divisors is an integer number (12613796550).

Almost surely, 250453621531 is an apocalyptic number.

50453621531 is a deficient number, since it is larger than the sum of its proper divisors (1564669).

50453621531 is a wasteful number, since it uses less digits than its factorization.

50453621531 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1564668.

The product of its (nonzero) digits is 54000, while the sum is 35.

The spelling of 50453621531 in words is "fifty billion, four hundred fifty-three million, six hundred twenty-one thousand, five hundred thirty-one".

Divisors: 1 32939 1531729 50453621531