Base | Representation |
---|---|
bin | 11110000011111110010111… |
… | …101001010011101101010111 |
3 | 122100010120210101201021120210 |
4 | 132003332113221103231113 |
5 | 114312200320222223030 |
6 | 1145110302455500503 |
7 | 36564120056065161 |
oct | 3603762751235527 |
9 | 570116711637523 |
10 | 132214522461015 |
11 | 39144956116105 |
12 | 129b4088087733 |
13 | 58a0a11a65007 |
14 | 2491307767931 |
15 | 104430a931bb0 |
hex | 783f97a53b57 |
132214522461015 has 16 divisors (see below), whose sum is σ = 220740767935488. Its totient is φ = 67448567979936.
The previous prime is 132214522460989. The next prime is 132214522461023. The reversal of 132214522461015 is 510164225412231.
It is not a de Polignac number, because 132214522461015 - 28 = 132214522460759 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 191615249599 + ... + 191615250288.
It is an arithmetic number, because the mean of its divisors is an integer number (13796297995968).
Almost surely, 2132214522461015 is an apocalyptic number.
132214522461015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
132214522461015 is a deficient number, since it is larger than the sum of its proper divisors (88526245474473).
132214522461015 is a wasteful number, since it uses less digits than its factorization.
132214522461015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383230499918.
The product of its (nonzero) digits is 115200, while the sum is 39.
Adding to 132214522461015 its reverse (510164225412231), we get a palindrome (642378747873246).
The spelling of 132214522461015 in words is "one hundred thirty-two trillion, two hundred fourteen billion, five hundred twenty-two million, four hundred sixty-one thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •