Search a number
-
+
25275275030139 = 310321816305753
BaseRepresentation
bin1011011111100110110111…
…10010100010111001111011
310022111021220101010001102120
411233303123302202321323
511303102230401431024
6125431145005532323
75216035606646241
oct557633362427173
9108437811101376
1025275275030139
118065202914002
122a026265740a3
1311145a9937904
14635489112791
152dc7042be479
hex16fcdbca2e7b

25275275030139 has 8 divisors (see below), whose sum is σ = 33703631971152. Its totient is φ = 16848550721280.

The previous prime is 25275275030129. The next prime is 25275275030141. The reversal of 25275275030139 is 93103057257252.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 25275275030139 - 225 = 25275241475707 is a prime.

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

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 408121914 + ... + 408183839.

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

Almost surely, 225275275030139 is an apocalyptic number.

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

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

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

The sum of its prime factors is 816316077.

The product of its (nonzero) digits is 3969000, while the sum is 51.

The spelling of 25275275030139 in words is "twenty-five trillion, two hundred seventy-five billion, two hundred seventy-five million, thirty thousand, one hundred thirty-nine".

Divisors: 1 3 10321 30963 816305753 2448917259 8425091676713 25275275030139