Base | Representation |
---|---|
bin | 11111010001011101011… |
… | …000110111110110010000 |
3 | 21121110002000120012011001 |
4 | 133101131120313312100 |
5 | 240202223403334141 |
6 | 4323132105231344 |
7 | 311156321263642 |
oct | 37213530676620 |
9 | 7543060505131 |
10 | 2149050449296 |
11 | 759452a53493 |
12 | 2a8600792554 |
13 | 12786818b3ba |
14 | 7602c0a6892 |
15 | 3ad7d543a31 |
hex | 1f45d637d90 |
2149050449296 has 45 divisors (see below), whose sum is σ = 4394693702721. Its totient is φ = 1017918490752.
The previous prime is 2149050449291. The next prime is 2149050449317. The reversal of 2149050449296 is 6929440509412.
The square root of 2149050449296 is 1465964.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1495151799696 + 653898649600 = 1222764^2 + 808640^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2149050449291) 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 8 ways as a sum of consecutive naturals, for example, 111403620 + ... + 111422908.
Almost surely, 22149050449296 is an apocalyptic number.
2149050449296 is the 1465964-th square number.
It is an amenable number.
2149050449296 is an abundant number, since it is smaller than the sum of its proper divisors (2245643253425).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2149050449296 is an frugal number, since it uses more digits than its factorization.
2149050449296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38624 (or 19310 counting only the distinct ones).
The product of its (nonzero) digits is 5598720, while the sum is 55.
The spelling of 2149050449296 in words is "two trillion, one hundred forty-nine billion, fifty million, four hundred forty-nine thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •