Search a number
-
+
132256335150545 = 5211125361455119
BaseRepresentation
bin11110000100100101010011…
…111000000011110111010001
3122100021120201101122222122112
4132010211103320003313101
5114313341433244304140
61145141415510515105
736600130164064124
oct3604452370036721
9570246641588575
10132256335150545
1139160662305671
1212a001b7065a95
1358a494652b418
1424933529923bb
15104545662bc65
hex784953e03dd1

132256335150545 has 8 divisors (see below), whose sum is σ = 159459770912640. Its totient is φ = 105303622299120.

The previous prime is 132256335150491. The next prime is 132256335150571. The reversal of 132256335150545 is 545051533652231.

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

It is not a de Polignac number, because 132256335150545 - 242 = 127858288639441 is a prime.

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

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 62680726505 + ... + 62680728614.

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

Almost surely, 2132256335150545 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 125361455335.

The product of its (nonzero) digits is 8100000, while the sum is 50.

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

Divisors: 1 5 211 1055 125361455119 626807275595 26451267030109 132256335150545