Search a number
-
+
10157642435 = 53165533177
BaseRepresentation
bin10010111010111000…
…10101001011000011
3222012220101200220002
421131130111023003
5131300324024220
64355533310215
7506500351613
oct113534251303
928186350802
1010157642435
1143427a7116
121b7593536b
13c5b563b15
146c507aa43
153e6b4bc75
hex25d7152c3

10157642435 has 8 divisors (see below), whose sum is σ = 12582370176. Its totient is φ = 7863981120.

The previous prime is 10157642431. The next prime is 10157642437. The reversal of 10157642435 is 53424675101.

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

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

It is not a de Polignac number, because 10157642435 - 22 = 10157642431 is a prime.

It is a Duffinian number.

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

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

Almost surely, 210157642435 is an apocalyptic number.

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

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

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

The sum of its prime factors is 65533213.

The product of its (nonzero) digits is 100800, while the sum is 38.

The spelling of 10157642435 in words is "ten billion, one hundred fifty-seven million, six hundred forty-two thousand, four hundred thirty-five".

Divisors: 1 5 31 155 65533177 327665885 2031528487 10157642435