Search a number
-
+
5029575841321 = 47107012251943
BaseRepresentation
bin100100100110000101000…
…0101001101011000101001
3122210211012210021112110121
41021030022011031120221
51124401032403410241
614410315533243241
71026242402156563
oct111141205153051
918724183245417
105029575841321
11166a038494929
12692922933521
132a63966097a5
1413560b73c333
158ac6deb3ad1
hex4930a14d629

5029575841321 has 4 divisors (see below), whose sum is σ = 5136588093312. Its totient is φ = 4922563589332.

The previous prime is 5029575841309. The next prime is 5029575841331. The reversal of 5029575841321 is 1231485759205.

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 5029575841321 - 215 = 5029575808553 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (5029575841331) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53506125925 + ... + 53506126018.

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

Almost surely, 25029575841321 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 107012251990.

The product of its (nonzero) digits is 3024000, while the sum is 52.

The spelling of 5029575841321 in words is "five trillion, twenty-nine billion, five hundred seventy-five million, eight hundred forty-one thousand, three hundred twenty-one".

Divisors: 1 47 107012251943 5029575841321