Base | Representation |
---|---|
bin | 11111001101111110100… |
… | …101100000101011011101 |
3 | 21121002102111211210122011 |
4 | 133031332211200223131 |
5 | 240122044441134401 |
6 | 4321313134551221 |
7 | 310664561614462 |
oct | 37157645405335 |
9 | 7532374753564 |
10 | 2145312443101 |
11 | 757904a45073 |
12 | 2a7938968511 |
13 | 1273c091b609 |
14 | 75b95871669 |
15 | 3ac102c1451 |
hex | 1f37e960add |
2145312443101 has 6 divisors (see below), whose sum is σ = 2177809940670. Its totient is φ = 2113292849976.
The previous prime is 2145312443093. The next prime is 2145312443111. The reversal of 2145312443101 is 1013442135412.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1988520202201 + 156792240900 = 1410149^2 + 395970^2 .
It is not a de Polignac number, because 2145312443101 - 23 = 2145312443093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2145312443111) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 238947666 + ... + 238956643.
It is an arithmetic number, because the mean of its divisors is an integer number (362968323445).
Almost surely, 22145312443101 is an apocalyptic number.
It is an amenable number.
2145312443101 is a deficient number, since it is larger than the sum of its proper divisors (32497497569).
2145312443101 is an frugal number, since it uses more digits than its factorization.
2145312443101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477904443 (or 477904376 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 2145312443101 its reverse (1013442135412), we get a palindrome (3158754578513).
The spelling of 2145312443101 in words is "two trillion, one hundred forty-five billion, three hundred twelve million, four hundred forty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •