Base | Representation |
---|---|
bin | 11110000011000010111000… |
… | …100011101100111001101111 |
3 | 122022220110221000122200100111 |
4 | 132003002320203230321233 |
5 | 114310124012413130111 |
6 | 1145021100502040451 |
7 | 36556366206165601 |
oct | 3603027043547157 |
9 | 568813830580314 |
10 | 132150650130031 |
11 | 3911a859924505 |
12 | 129a3821419127 |
13 | 58979a2c96c20 |
14 | 248c1a88b5171 |
15 | 104281d276a21 |
hex | 7830b88ece6f |
132150650130031 has 16 divisors (see below), whose sum is σ = 143143037190720. Its totient is φ = 121276441658880.
The previous prime is 132150650129969. The next prime is 132150650130101. The reversal of 132150650130031 is 130031056051231.
It is a cyclic number.
It is not a de Polignac number, because 132150650130031 - 217 = 132150649998959 is a prime.
It is a super-2 number, since 2×1321506501300312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132150650129975 and 132150650130002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132150650160031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 75167446 + ... + 76905436.
It is an arithmetic number, because the mean of its divisors is an integer number (8946439824420).
Almost surely, 2132150650130031 is an apocalyptic number.
132150650130031 is a deficient number, since it is larger than the sum of its proper divisors (10992387060689).
132150650130031 is a wasteful number, since it uses less digits than its factorization.
132150650130031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1771986.
The product of its (nonzero) digits is 8100, while the sum is 31.
The spelling of 132150650130031 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred fifty million, one hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •