Base | Representation |
---|---|
bin | 100100011000011111011… |
… | …110000110001001001001 |
3 | 22212000110011102020112201 |
4 | 210120133132012021021 |
5 | 311430401412340244 |
6 | 5152324152240201 |
7 | 345430155265105 |
oct | 44303736061111 |
9 | 8760404366481 |
10 | 2500198949449 |
11 | 884368143a13 |
12 | 34467b6a0061 |
13 | 1519c998c1c6 |
14 | 890202a0905 |
15 | 4508130dad4 |
hex | 2461f786249 |
2500198949449 has 4 divisors (see below), whose sum is σ = 2500207924500. Its totient is φ = 2500189974400.
The previous prime is 2500198949441. The next prime is 2500198949509. The reversal of 2500198949449 is 9449498910052.
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 783331203600 + 1716867745849 = 885060^2 + 1310293^2 .
It is a cyclic number.
It is not a de Polignac number, because 2500198949449 - 23 = 2500198949441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2500198949441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4055824 + ... + 4631425.
It is an arithmetic number, because the mean of its divisors is an integer number (625051981125).
Almost surely, 22500198949449 is an apocalyptic number.
It is an amenable number.
2500198949449 is a deficient number, since it is larger than the sum of its proper divisors (8975051).
2500198949449 is an equidigital number, since it uses as much as digits as its factorization.
2500198949449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8975050.
The product of its (nonzero) digits is 33592320, while the sum is 64.
The spelling of 2500198949449 in words is "two trillion, five hundred billion, one hundred ninety-eight million, nine hundred forty-nine thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •