Base | Representation |
---|---|
bin | 111111100000100… |
… | …1010101110101001 |
3 | 12111111212122121200 |
4 | 1333001022232221 |
5 | 13331014400041 |
6 | 551242554413 |
7 | 103544210331 |
oct | 17701125651 |
9 | 5444778550 |
10 | 2131012521 |
11 | 9a39a0280 |
12 | 4b5808a09 |
13 | 27c658971 |
14 | 1630400c1 |
15 | c71411b6 |
hex | 7f04aba9 |
2131012521 has 24 divisors (see below), whose sum is σ = 3448720704. Its totient is φ = 1256614560.
The previous prime is 2131012517. The next prime is 2131012523. The reversal of 2131012521 is 1252101312.
2131012521 is a `hidden beast` number, since 2 + 131 + 0 + 12 + 521 = 666.
It is not a de Polignac number, because 2131012521 - 22 = 2131012517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2131012494 and 2131012503.
It is not an unprimeable number, because it can be changed into a prime (2131012523) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 287221 + ... + 294546.
It is an arithmetic number, because the mean of its divisors is an integer number (143696696).
Almost surely, 22131012521 is an apocalyptic number.
It is an amenable number.
2131012521 is a deficient number, since it is larger than the sum of its proper divisors (1317708183).
2131012521 is a wasteful number, since it uses less digits than its factorization.
2131012521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 581821 (or 581818 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 2131012521 is about 46162.8911681233. The cubic root of 2131012521 is about 1286.8521934933.
Adding to 2131012521 its reverse (1252101312), we get a palindrome (3383113833).
The spelling of 2131012521 in words is "two billion, one hundred thirty-one million, twelve thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •