Base | Representation |
---|---|
bin | 11110000011000011010101… |
… | …001011000111001011010011 |
3 | 122022220112011111000221112020 |
4 | 132003003111023013023103 |
5 | 114310131003314121230 |
6 | 1145021220252102523 |
7 | 36556414126002510 |
oct | 3603032513071323 |
9 | 568815144027466 |
10 | 132151130223315 |
11 | 3911aa85924715 |
12 | 129a3936164a43 |
13 | 5897a4b59c1a8 |
14 | 248c212568307 |
15 | 104284a4ab810 |
hex | 7830d52c72d3 |
132151130223315 has 32 divisors (see below), whose sum is σ = 242122531138560. Its totient is φ = 60293257705344.
The previous prime is 132151130223283. The next prime is 132151130223323. The reversal of 132151130223315 is 513322031151231.
It is a happy number.
It is not a de Polignac number, because 132151130223315 - 25 = 132151130223283 is a prime.
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 31 ways as a sum of consecutive naturals, for example, 1236274839 + ... + 1236381728.
It is an arithmetic number, because the mean of its divisors is an integer number (7566329098080).
Almost surely, 2132151130223315 is an apocalyptic number.
132151130223315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
132151130223315 is a deficient number, since it is larger than the sum of its proper divisors (109971400915245).
132151130223315 is a wasteful number, since it uses less digits than its factorization.
132151130223315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2472657091.
The product of its (nonzero) digits is 16200, while the sum is 33.
Adding to 132151130223315 its reverse (513322031151231), we get a palindrome (645473161374546).
The spelling of 132151130223315 in words is "one hundred thirty-two trillion, one hundred fifty-one billion, one hundred thirty million, two hundred twenty-three thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •