Base | Representation |
---|---|
bin | 11111000000111011100… |
… | …001100100011000010101 |
3 | 21112202021010112121121020 |
4 | 133000323201210120111 |
5 | 234404401410344300 |
6 | 4311035023511353 |
7 | 306660442532031 |
oct | 37007341443025 |
9 | 7482233477536 |
10 | 2131302434325 |
11 | 751975730119 |
12 | 2a5088a58559 |
13 | 125c9a216bac |
14 | 75226d111c1 |
15 | 3a6903628a0 |
hex | 1f03b864615 |
2131302434325 has 24 divisors (see below), whose sum is σ = 3524743896000. Its totient is φ = 1136375103360.
The previous prime is 2131302434279. The next prime is 2131302434383. The reversal of 2131302434325 is 5234342031312.
It is not a de Polignac number, because 2131302434325 - 27 = 2131302434197 is a prime.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3725400 + ... + 4259249.
It is an arithmetic number, because the mean of its divisors is an integer number (146864329000).
Almost surely, 22131302434325 is an apocalyptic number.
2131302434325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2131302434325 is a deficient number, since it is larger than the sum of its proper divisors (1393441461675).
2131302434325 is a wasteful number, since it uses less digits than its factorization.
2131302434325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7988221 (or 7988216 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 33.
Adding to 2131302434325 its reverse (5234342031312), we get a palindrome (7365644465637).
The spelling of 2131302434325 in words is "two trillion, one hundred thirty-one billion, three hundred two million, four hundred thirty-four thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •