Base | Representation |
---|---|
bin | 11111010001011101011… |
… | …111101000000001111001 |
3 | 21121110002010220010102122 |
4 | 133101131133220001321 |
5 | 240202224332011023 |
6 | 4323132211211025 |
7 | 311156342315633 |
oct | 37213537500171 |
9 | 7543063803378 |
10 | 2149052219513 |
11 | 759453a52481 |
12 | 2a86012a6a75 |
13 | 12786865b074 |
14 | 7602c407a53 |
15 | 3ad7d7932c8 |
hex | 1f45d7e8079 |
2149052219513 has 4 divisors (see below), whose sum is σ = 2201468127348. Its totient is φ = 2096636311680.
The previous prime is 2149052219477. The next prime is 2149052219519. The reversal of 2149052219513 is 3159122509412.
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 321440239849 + 1827611979664 = 566957^2 + 1351892^2 .
It is a cyclic number.
It is not a de Polignac number, because 2149052219513 - 218 = 2149051957369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2149052219519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26207953856 + ... + 26207953937.
It is an arithmetic number, because the mean of its divisors is an integer number (550367031837).
Almost surely, 22149052219513 is an apocalyptic number.
It is an amenable number.
2149052219513 is a deficient number, since it is larger than the sum of its proper divisors (52415907835).
2149052219513 is an equidigital number, since it uses as much as digits as its factorization.
2149052219513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52415907834.
The product of its (nonzero) digits is 194400, while the sum is 44.
The spelling of 2149052219513 in words is "two trillion, one hundred forty-nine billion, fifty-two million, two hundred nineteen thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •