Base | Representation |
---|---|
bin | 11111000001110111101… |
… | …101111110110100100001 |
3 | 21112211212111211012010000 |
4 | 133001313231332310201 |
5 | 234413433423240223 |
6 | 4311323141130213 |
7 | 310024454451666 |
oct | 37016755766441 |
9 | 7484774735100 |
10 | 2132312321313 |
11 | 752343797169 |
12 | 2a530b0b9969 |
13 | 1260cb506365 |
14 | 752c10b3a6d |
15 | 3a6edd48543 |
hex | 1f077b7ed21 |
2132312321313 has 20 divisors (see below), whose sum is σ = 3262996457028. Its totient is φ = 1386869800320.
The previous prime is 2132312321239. The next prime is 2132312321327. The reversal of 2132312321313 is 3131232132312.
2132312321313 is a `hidden beast` number, since 2 + 1 + 3 + 2 + 312 + 32 + 1 + 313 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 258499031184 + 1873813290129 = 508428^2 + 1368873^2 .
It is not a de Polignac number, because 2132312321313 - 218 = 2132312059169 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (2132312322313) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 321031356 + ... + 321037997.
Almost surely, 22132312321313 is an apocalyptic number.
It is an amenable number.
2132312321313 is a deficient number, since it is larger than the sum of its proper divisors (1130684135715).
2132312321313 is an equidigital number, since it uses as much as digits as its factorization.
2132312321313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 642069406 (or 642069397 counting only the distinct ones).
The product of its digits is 3888, while the sum is 27.
Adding to 2132312321313 its reverse (3131232132312), we get a palindrome (5263544453625).
The spelling of 2132312321313 in words is "two trillion, one hundred thirty-two billion, three hundred twelve million, three hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •