Base | Representation |
---|---|
bin | 11111000001101100101… |
… | …100111110001001110101 |
3 | 21112211101122001122121201 |
4 | 133001230230332021311 |
5 | 234413044120211221 |
6 | 4311252540012501 |
7 | 310020051532636 |
oct | 37015454761165 |
9 | 7484348048551 |
10 | 2132127507061 |
11 | 752259436512 |
12 | 2a5279231131 |
13 | 12609c138106 |
14 | 752a472588d |
15 | 3a6dc9dd891 |
hex | 1f06cb3e275 |
2132127507061 has 8 divisors (see below), whose sum is σ = 2150930708064. Its totient is φ = 2113398774960.
The previous prime is 2132127506939. The next prime is 2132127507113. The reversal of 2132127507061 is 1607057212312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2132127507061 - 29 = 2132127506549 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2132127507061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2132127502061) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 18559711 + ... + 18674236.
It is an arithmetic number, because the mean of its divisors is an integer number (268866338508).
Almost surely, 22132127507061 is an apocalyptic number.
It is an amenable number.
2132127507061 is a deficient number, since it is larger than the sum of its proper divisors (18803201003).
2132127507061 is a wasteful number, since it uses less digits than its factorization.
2132127507061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37234451.
The product of its (nonzero) digits is 35280, while the sum is 37.
The spelling of 2132127507061 in words is "two trillion, one hundred thirty-two billion, one hundred twenty-seven million, five hundred seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •