Base | Representation |
---|---|
bin | 11111000001110111001… |
… | …010111001011101101011 |
3 | 21112211211212111221020001 |
4 | 133001313022321131223 |
5 | 234413424044434311 |
6 | 4311322212043431 |
7 | 310024313335432 |
oct | 37016712713553 |
9 | 7484755457201 |
10 | 2132303124331 |
11 | 752339585356 |
12 | 2a5308003577 |
13 | 1260c9636163 |
14 | 752bdb9c119 |
15 | 3a6ed12d4c1 |
hex | 1f0772b976b |
2132303124331 has 12 divisors (see below), whose sum is σ = 2163475471752. Its totient is φ = 2101569029664.
The previous prime is 2132303124317. The next prime is 2132303124349. The reversal of 2132303124331 is 1334213032312.
It is a de Polignac number, because none of the positive numbers 2k-2132303124331 is a prime.
It is a super-2 number, since 2×21323031243312 (a number of 25 digits) contains 22 as substring.
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 2132303124331.
It is not an unprimeable number, because it can be changed into a prime (2132303124361) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3210255 + ... + 3817111.
It is an arithmetic number, because the mean of its divisors is an integer number (180289622646).
Almost surely, 22132303124331 is an apocalyptic number.
2132303124331 is a deficient number, since it is larger than the sum of its proper divisors (31172347421).
2132303124331 is an frugal number, since it uses more digits than its factorization.
2132303124331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607578 (or 607499 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 2132303124331 its reverse (1334213032312), we get a palindrome (3466516156643).
The spelling of 2132303124331 in words is "two trillion, one hundred thirty-two billion, three hundred three million, one hundred twenty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •