Base | Representation |
---|---|
bin | 11111010100010101000… |
… | …100110110111010001111 |
3 | 21121202000210102212112012 |
4 | 133110111010312322033 |
5 | 240230031321212234 |
6 | 4324401554131435 |
7 | 311325561645650 |
oct | 37242504667217 |
9 | 7552023385465 |
10 | 2152132210319 |
11 | 75a794588123 |
12 | 2a9120880b7b |
13 | 127c3979b730 |
14 | 762414b3527 |
15 | 3aeadd880ce |
hex | 1f515136e8f |
2152132210319 has 8 divisors (see below), whose sum is σ = 2648778105120. Its totient is φ = 1702785924576.
The previous prime is 2152132210229. The next prime is 2152132210343. The reversal of 2152132210319 is 9130122312512.
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 2152132210319 - 224 = 2152115433103 is a prime.
It is a super-4 number, since 4×21521322103194 (a number of 50 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2152132210819) 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, 11824902164 + ... + 11824902345.
It is an arithmetic number, because the mean of its divisors is an integer number (331097263140).
Almost surely, 22152132210319 is an apocalyptic number.
2152132210319 is a deficient number, since it is larger than the sum of its proper divisors (496645894801).
2152132210319 is a wasteful number, since it uses less digits than its factorization.
2152132210319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23649804529.
The product of its (nonzero) digits is 6480, while the sum is 32.
The spelling of 2152132210319 in words is "two trillion, one hundred fifty-two billion, one hundred thirty-two million, two hundred ten thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •