Search a number
-
+
152055065201 = 1343272012639
BaseRepresentation
bin1000110110011100110…
…0000010101001110001
3112112110222102122100112
42031213030002221301
54442402044041301
6153504135431105
713662031504664
oct2154714025161
9475428378315
10152055065201
1159539136046
1225576b25495
1311453266580
1475066a16db
153e4e21c9bb
hex2367302a71

152055065201 has 8 divisors (see below), whose sum is σ = 167559786240. Its totient is φ = 137094369552.

The previous prime is 152055065189. The next prime is 152055065269. The reversal of 152055065201 is 102560550251.

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

It is a cyclic number.

It is not a de Polignac number, because 152055065201 - 230 = 150981323377 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2152055065201 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 272012695.

The product of its (nonzero) digits is 15000, while the sum is 32.

The spelling of 152055065201 in words is "one hundred fifty-two billion, fifty-five million, sixty-five thousand, two hundred one".

Divisors: 1 13 43 559 272012639 3536164307 11696543477 152055065201