Base | Representation |
---|---|
bin | 11110000100100000101001… |
… | …101011100011110001100111 |
3 | 122100021002210201211222010210 |
4 | 132010200221223203301213 |
5 | 114313301212024404030 |
6 | 1145135231233350503 |
7 | 36566562205202160 |
oct | 3604405153436147 |
9 | 570232721758123 |
10 | 132251332263015 |
11 | 39159525306179 |
12 | 129bb23b708433 |
13 | 58a4329bcb444 |
14 | 2492dda37c767 |
15 | 1045262304bb0 |
hex | 784829ae3c67 |
132251332263015 has 32 divisors (see below), whose sum is σ = 241834746180096. Its totient is φ = 60456817238400.
The previous prime is 132251332262977. The next prime is 132251332263049. The reversal of 132251332263015 is 510362233152231.
It is not a de Polignac number, because 132251332263015 - 210 = 132251332261991 is a prime.
It is a super-2 number, since 2×1322513322630152 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
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, 2888917 + ... + 16518126.
It is an arithmetic number, because the mean of its divisors is an integer number (7557335818128).
Almost surely, 2132251332263015 is an apocalyptic number.
132251332263015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
132251332263015 is a deficient number, since it is larger than the sum of its proper divisors (109583413917081).
132251332263015 is a wasteful number, since it uses less digits than its factorization.
132251332263015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19471959.
The product of its (nonzero) digits is 194400, while the sum is 39.
The spelling of 132251332263015 in words is "one hundred thirty-two trillion, two hundred fifty-one billion, three hundred thirty-two million, two hundred sixty-three thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •