Base | Representation |
---|---|
bin | 11110000011001110000010… |
… | …101100011001100010110001 |
3 | 122022221121212000102022201110 |
4 | 132003032002230121202301 |
5 | 114310323032110423012 |
6 | 1145030401421023533 |
7 | 36560302131622515 |
oct | 3603160254314261 |
9 | 568847760368643 |
10 | 132162631342257 |
11 | 39124947a1359a |
12 | 129a60059b4ba9 |
13 | 5898b62281009 |
14 | 248c9c3c02145 |
15 | 1042cc003573c |
hex | 783382b198b1 |
132162631342257 has 64 divisors (see below), whose sum is σ = 181816892928000. Its totient is φ = 85345317308160.
The previous prime is 132162631342243. The next prime is 132162631342271. The reversal of 132162631342257 is 752243136261231.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (132162631342243) and next prime (132162631342271).
It is not a de Polignac number, because 132162631342257 - 27 = 132162631342129 is a prime.
It is a super-2 number, since 2×1321626313422572 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (132162631343257) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 18461042844 + ... + 18461050002.
It is an arithmetic number, because the mean of its divisors is an integer number (2840888952000).
Almost surely, 2132162631342257 is an apocalyptic number.
It is an amenable number.
132162631342257 is a deficient number, since it is larger than the sum of its proper divisors (49654261585743).
132162631342257 is a wasteful number, since it uses less digits than its factorization.
132162631342257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9358.
The product of its digits is 2177280, while the sum is 48.
The spelling of 132162631342257 in words is "one hundred thirty-two trillion, one hundred sixty-two billion, six hundred thirty-one million, three hundred forty-two thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •