Search a number
-
+
152533256254651 = 199766498775149
BaseRepresentation
bin100010101011101001101010…
…100011100011010010111011
3202000002000222220001010122101
4202223221222203203102323
5124443101102100122101
61300224451025204231
744062110166504546
oct4253515243432273
9660060886033571
10152533256254651
1144668a99692918
1215135b72a90677
136715a94119c2c
142994912ba785d
151297b1797a401
hex8aba6a8e34bb

152533256254651 has 4 divisors (see below), whose sum is σ = 153299755030000. Its totient is φ = 151766757479304.

The previous prime is 152533256254633. The next prime is 152533256254661. The reversal of 152533256254651 is 156452652335251.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 152533256254651 - 25 = 152533256254619 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 2152533256254651 is an apocalyptic number.

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

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

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

The sum of its prime factors is 766498775348.

The product of its digits is 32400000, while the sum is 55.

The spelling of 152533256254651 in words is "one hundred fifty-two trillion, five hundred thirty-three billion, two hundred fifty-six million, two hundred fifty-four thousand, six hundred fifty-one".

Divisors: 1 199 766498775149 152533256254651