Base | Representation |
---|---|
bin | 111111001110011… |
… | …1111000011101011 |
3 | 12110212000202122202 |
4 | 1332130333003223 |
5 | 13321102340111 |
6 | 550303410415 |
7 | 103400454314 |
oct | 17634770353 |
9 | 5425022582 |
10 | 2121527531 |
11 | 999602042 |
12 | 4b25b3a0b |
13 | 27a6b7646 |
14 | 161a9160b |
15 | c63bab3b |
hex | 7e73f0eb |
2121527531 has 4 divisors (see below), whose sum is σ = 2121740064. Its totient is φ = 2121315000.
The previous prime is 2121527519. The next prime is 2121527561. The reversal of 2121527531 is 1357251212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2121527531 - 26 = 2121527467 is a prime.
It is a super-2 number, since 2×21215275312 = 9001758129581911922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2121527494 and 2121527503.
It is not an unprimeable number, because it can be changed into a prime (2121527561) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 90515 + ... + 111516.
It is an arithmetic number, because the mean of its divisors is an integer number (530435016).
Almost surely, 22121527531 is an apocalyptic number.
2121527531 is a deficient number, since it is larger than the sum of its proper divisors (212533).
2121527531 is a wasteful number, since it uses less digits than its factorization.
2121527531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212532.
The product of its digits is 4200, while the sum is 29.
The square root of 2121527531 is about 46060.0426725812. The cubic root of 2121527531 is about 1284.9401236818.
Adding to 2121527531 its reverse (1357251212), we get a palindrome (3478778743).
The spelling of 2121527531 in words is "two billion, one hundred twenty-one million, five hundred twenty-seven thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •