Base | Representation |
---|---|
bin | 1001110111100011… |
… | …1001111001100101 |
3 | 20211121110002201211 |
4 | 2131320321321211 |
5 | 20411112041013 |
6 | 1114503551421 |
7 | 122433422350 |
oct | 23570717145 |
9 | 6747402654 |
10 | 2648940133 |
11 | 113a291a24 |
12 | 61b15b571 |
13 | 332a49ac8 |
14 | 1b1b41297 |
15 | 10784b23d |
hex | 9de39e65 |
2648940133 has 4 divisors (see below), whose sum is σ = 3027360160. Its totient is φ = 2270520108.
The previous prime is 2648940121. The next prime is 2648940167. The reversal of 2648940133 is 3310498462.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2648940133 - 25 = 2648940101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2648940113) 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, 189210003 + ... + 189210016.
It is an arithmetic number, because the mean of its divisors is an integer number (756840040).
Almost surely, 22648940133 is an apocalyptic number.
It is an amenable number.
2648940133 is a deficient number, since it is larger than the sum of its proper divisors (378420027).
2648940133 is an equidigital number, since it uses as much as digits as its factorization.
2648940133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378420026.
The product of its (nonzero) digits is 124416, while the sum is 40.
The square root of 2648940133 is about 51467.8553370937. The cubic root of 2648940133 is about 1383.6429918608.
The spelling of 2648940133 in words is "two billion, six hundred forty-eight million, nine hundred forty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •