Base | Representation |
---|---|
bin | 11111000100011010100… |
… | …100011110001011011001 |
3 | 21120002220220220222121001 |
4 | 133010122210132023121 |
5 | 234440032343431041 |
6 | 4312454221345001 |
7 | 310152251636602 |
oct | 37043244361331 |
9 | 7502826828531 |
10 | 2135044514521 |
11 | 753515a71386 |
12 | 2a5952108161 |
13 | 126445582129 |
14 | 7549dcc6da9 |
15 | 3a80db3c131 |
hex | 1f11a91e2d9 |
2135044514521 has 4 divisors (see below), whose sum is σ = 2135219573412. Its totient is φ = 2134869455632.
The previous prime is 2135044514509. The next prime is 2135044514539. The reversal of 2135044514521 is 1254154405312.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1911206711296 + 223837803225 = 1382464^2 + 473115^2 .
It is a cyclic number.
It is not a de Polignac number, because 2135044514521 - 217 = 2135044383449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2135044514221) 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, 87511150 + ... + 87535543.
It is an arithmetic number, because the mean of its divisors is an integer number (533804893353).
Almost surely, 22135044514521 is an apocalyptic number.
It is an amenable number.
2135044514521 is a deficient number, since it is larger than the sum of its proper divisors (175058891).
2135044514521 is a wasteful number, since it uses less digits than its factorization.
2135044514521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175058890.
The product of its (nonzero) digits is 96000, while the sum is 37.
Adding to 2135044514521 its reverse (1254154405312), we get a palindrome (3389198919833).
The spelling of 2135044514521 in words is "two trillion, one hundred thirty-five billion, forty-four million, five hundred fourteen thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •