Search a number
-
+
152100770751 = 3297598729101
BaseRepresentation
bin1000110110100111101…
…0011001001110111111
3112112121011102201120200
42031221322121032333
54443000244131001
6153512451214543
713663125135216
oct2155172311677
9475534381520
10152100770751
1159561a13326
122558a2a7453
131145c87a087
14750c79c07d
153e5324a086
hex2369e993bf

152100770751 has 24 divisors (see below), whose sum is σ = 222010776624. Its totient is φ = 100334937600.

The previous prime is 152100770749. The next prime is 152100770821. The reversal of 152100770751 is 157077001251.

It is not a de Polignac number, because 152100770751 - 21 = 152100770749 is a prime.

It is a super-3 number, since 3×1521007707513 (a number of 35 digits) contains 333 as substring.

It is a congruent number.

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5212101 + ... + 5241201.

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

Almost surely, 2152100770751 is an apocalyptic number.

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

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

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

The sum of its prime factors is 35191 (or 35188 counting only the distinct ones).

The product of its (nonzero) digits is 17150, while the sum is 36.

The spelling of 152100770751 in words is "one hundred fifty-two billion, one hundred million, seven hundred seventy thousand, seven hundred fifty-one".

Divisors: 1 3 9 97 291 873 5987 17961 29101 53883 87303 261909 580739 1742217 2822797 5226651 8468391 25405173 174227687 522683061 1568049183 16900085639 50700256917 152100770751