Base | Representation |
---|---|
bin | 11110000011000010101111… |
… | …111111110110101110111011 |
3 | 122022220110120000102022002121 |
4 | 132003002233333312232323 |
5 | 114310123214131443022 |
6 | 1145021034331542111 |
7 | 36556362513402163 |
oct | 3603025777665673 |
9 | 568813500368077 |
10 | 132150506515387 |
11 | 3911a795853718 |
12 | 129a37a12ba937 |
13 | 589797c2c2549 |
14 | 248c1937ad5a3 |
15 | 10428108592c7 |
hex | 7830afff6bbb |
132150506515387 has 2 divisors, whose sum is σ = 132150506515388. Its totient is φ = 132150506515386.
The previous prime is 132150506515351. The next prime is 132150506515477. The reversal of 132150506515387 is 783515605051231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 132150506515387 - 27 = 132150506515259 is a prime.
It is not a weakly prime, because it can be changed into another prime (132150506515087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66075253257693 + 66075253257694.
It is an arithmetic number, because the mean of its divisors is an integer number (66075253257694).
Almost surely, 2132150506515387 is an apocalyptic number.
132150506515387 is a deficient number, since it is larger than the sum of its proper divisors (1).
132150506515387 is an equidigital number, since it uses as much as digits as its factorization.
132150506515387 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780000, while the sum is 52.
The spelling of 132150506515387 in words is "one hundred thirty-two trillion, one hundred fifty billion, five hundred six million, five hundred fifteen thousand, three hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •