Base | Representation |
---|---|
bin | 11110110001000011010… |
… | …001010100101001010000 |
3 | 21111010020220010102202012 |
4 | 132301003101110221100 |
5 | 234114442121232422 |
6 | 4255135121042052 |
7 | 305515101636011 |
oct | 36610321245120 |
9 | 7433226112665 |
10 | 2114252524112 |
11 | 745716482233 |
12 | 2a190aa86328 |
13 | 1244b0a9a221 |
14 | 7448a75d008 |
15 | 39ee35cc4e2 |
hex | 1ec43454a50 |
2114252524112 has 80 divisors (see below), whose sum is σ = 4428841013712. Its totient is φ = 974148894720.
The previous prime is 2114252524073. The next prime is 2114252524183.
2114252524112 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 8 ways, for example, as 6482826256 + 2107769697856 = 80516^2 + 1451816^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2331662 + ... + 3108882.
Almost surely, 22114252524112 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 2114252524112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2214420506856).
2114252524112 is an abundant number, since it is smaller than the sum of its proper divisors (2314588489600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2114252524112 is a wasteful number, since it uses less digits than its factorization.
2114252524112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777456 (or 777450 counting only the distinct ones).
The product of its digits is 12800, while the sum is 32.
The spelling of 2114252524112 in words is "two trillion, one hundred fourteen billion, two hundred fifty-two million, five hundred twenty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •