Base | Representation |
---|---|
bin | 11111001101111000001… |
… | …001110010100101101101 |
3 | 21121002010222202101112221 |
4 | 133031320021302211231 |
5 | 240121334323410013 |
6 | 4321254321355341 |
7 | 310662111334033 |
oct | 37157011624555 |
9 | 7532128671487 |
10 | 2145204513133 |
11 | 75785a027750 |
12 | 2a7908798b51 |
13 | 1273a445c526 |
14 | 75b853b8553 |
15 | 3ac05aa208d |
hex | 1f37827296d |
2145204513133 has 8 divisors (see below), whose sum is σ = 2340303222240. Its totient is φ = 1950119156880.
The previous prime is 2145204513121. The next prime is 2145204513191. The reversal of 2145204513133 is 3313154025412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2145204513133 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 (2145204613133) 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 7 ways as a sum of consecutive naturals, for example, 3000810 + ... + 3646267.
It is an arithmetic number, because the mean of its divisors is an integer number (292537902780).
Almost surely, 22145204513133 is an apocalyptic number.
It is an amenable number.
2145204513133 is a deficient number, since it is larger than the sum of its proper divisors (195098709107).
2145204513133 is a wasteful number, since it uses less digits than its factorization.
2145204513133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6676427.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 2145204513133 its reverse (3313154025412), we get a palindrome (5458358538545).
The spelling of 2145204513133 in words is "two trillion, one hundred forty-five billion, two hundred four million, five hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •