Base | Representation |
---|---|
bin | 111111111100001… |
… | …1111011001110100 |
3 | 12112112011110110010 |
4 | 1333320133121310 |
5 | 13343222440444 |
6 | 552521500220 |
7 | 104111402064 |
oct | 17770373164 |
9 | 5475143403 |
10 | 2145515124 |
11 | a010a62a5 |
12 | 4ba641670 |
13 | 282665a9c |
14 | 164d373a4 |
15 | c85582b9 |
hex | 7fe1f674 |
2145515124 has 72 divisors (see below), whose sum is σ = 5358878784. Its totient is φ = 665792000.
The previous prime is 2145515111. The next prime is 2145515129. The reversal of 2145515124 is 4215155412.
It is a junction number, because it is equal to n+sod(n) for n = 2145515091 and 2145515100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2145515129) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2080489 + ... + 2081519.
It is an arithmetic number, because the mean of its divisors is an integer number (74428872).
Almost surely, 22145515124 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2145515124, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2679439392).
2145515124 is an abundant number, since it is smaller than the sum of its proper divisors (3213363660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2145515124 is a wasteful number, since it uses less digits than its factorization.
2145515124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1257 (or 1154 counting only the distinct ones).
The product of its digits is 8000, while the sum is 30.
The square root of 2145515124 is about 46319.7055690124. The cubic root of 2145515124 is about 1289.7648198154.
The spelling of 2145515124 in words is "two billion, one hundred forty-five million, five hundred fifteen thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •