Search a number
-
+
154951339053 = 377378635193
BaseRepresentation
bin1001000001001111010…
…0011100110000101101
3112210221211021121011110
42100103310130300231
510014320020322203
6155103400542233
714123560436040
oct2202364346055
9483854247143
10154951339053
115a794a9a4a5
1226044a81979
13117c5301294
1476dd1c6c57
15406d622d03
hex2413d1cc2d

154951339053 has 8 divisors (see below), whose sum is σ = 236116326208. Its totient is φ = 88543622304.

The previous prime is 154951338961. The next prime is 154951339057. The reversal of 154951339053 is 350933159451.

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

It is not a de Polignac number, because 154951339053 - 28 = 154951338797 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (154951339057) 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 7 ways as a sum of consecutive naturals, for example, 3689317576 + ... + 3689317617.

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

Almost surely, 2154951339053 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 7378635203.

The product of its (nonzero) digits is 1093500, while the sum is 48.

The spelling of 154951339053 in words is "one hundred fifty-four billion, nine hundred fifty-one million, three hundred thirty-nine thousand, fifty-three".

Divisors: 1 3 7 21 7378635193 22135905579 51650446351 154951339053