Search a number
-
+
152022640371 = 3731233521721
BaseRepresentation
bin1000110110010101000…
…0010110011011110011
3112112101201102021211220
42031211100112123303
54442320243442441
6153501020440123
713661156056650
oct2154520263363
9475351367756
10152022640371
11595218a9868
12255680a9043
1311449622994
147502260c27
153e4b465466
hex23654166f3

152022640371 has 16 divisors (see below), whose sum is σ = 239126243328. Its totient is φ = 84067819200.

The previous prime is 152022640351. The next prime is 152022640387. The reversal of 152022640371 is 173046220251.

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

It is not a de Polignac number, because 152022640371 - 211 = 152022638323 is a prime.

It is a super-2 number, since 2×1520226403712 (a number of 23 digits) contains 22 as substring.

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

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

Almost surely, 2152022640371 is an apocalyptic number.

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

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

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

The sum of its prime factors is 233521762.

The product of its (nonzero) digits is 20160, while the sum is 33.

The spelling of 152022640371 in words is "one hundred fifty-two billion, twenty-two million, six hundred forty thousand, three hundred seventy-one".

Divisors: 1 3 7 21 31 93 217 651 233521721 700565163 1634652047 4903956141 7239173351 21717520053 50674213457 152022640371