Search a number
-
+
254052151113 = 384684050371
BaseRepresentation
bin1110110010011010110…
…0000010111101001001
3220021202022221110110010
43230212230002331021
513130244322313423
6312413203142133
724232435440255
oct3544654027511
9807668843403
10254052151113
11988198a8372
12412a1674949
131ac5973cb47
14c420a5d265
15691d941693
hex3b26b02f49

254052151113 has 4 divisors (see below), whose sum is σ = 338736201488. Its totient is φ = 169368100740.

The previous prime is 254052151079. The next prime is 254052151121. The reversal of 254052151113 is 311151250452.

254052151113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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 not a de Polignac number, because 254052151113 - 224 = 254035373897 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 2254052151113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 84684050374.

The product of its (nonzero) digits is 6000, while the sum is 30.

The spelling of 254052151113 in words is "two hundred fifty-four billion, fifty-two million, one hundred fifty-one thousand, one hundred thirteen".

Divisors: 1 3 84684050371 254052151113