Search a number
-
+
1484948950773 = 3494982983591
BaseRepresentation
bin10101100110111101110…
…110101100111011110101
312020221220122102121122220
4111212331312230323311
5143312133412411043
63054102013312553
7212166263551401
oct25467566547365
95227818377586
101484948950773
11522843a74332
121bb962495759
13aa051135712
1451c2c758101
1528960d4e483
hex159bddacef5

1484948950773 has 4 divisors (see below), whose sum is σ = 1979931934368. Its totient is φ = 989965967180.

The previous prime is 1484948950687. The next prime is 1484948950781. The reversal of 1484948950773 is 3770598494841.

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 a de Polignac number, because none of the positive numbers 2k-1484948950773 is a prime.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 21484948950773 is an apocalyptic number.

It is an amenable number.

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

1484948950773 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 494982983594.

The product of its (nonzero) digits is 243855360, while the sum is 69.

The spelling of 1484948950773 in words is "one trillion, four hundred eighty-four billion, nine hundred forty-eight million, nine hundred fifty thousand, seven hundred seventy-three".

Divisors: 1 3 494982983591 1484948950773