Base | Representation |
---|---|
bin | 1000011101010101… |
… | …1110010000111101 |
3 | 12212020110001101002 |
4 | 2013111132100331 |
5 | 14122230200044 |
6 | 1013145500045 |
7 | 110160245324 |
oct | 20725362075 |
9 | 5766401332 |
10 | 2270553149 |
11 | a65739207 |
12 | 5344a1625 |
13 | 2a2534b97 |
14 | 1777a50bb |
15 | d450674e |
hex | 8755e43d |
2270553149 has 4 divisors (see below), whose sum is σ = 2271323964. Its totient is φ = 2269782336.
The previous prime is 2270553139. The next prime is 2270553191. The reversal of 2270553149 is 9413550722.
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 1389947524 + 880605625 = 37282^2 + 29675^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2270553149 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 (2270553139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 380972 + ... + 386885.
It is an arithmetic number, because the mean of its divisors is an integer number (567830991).
Almost surely, 22270553149 is an apocalyptic number.
It is an amenable number.
2270553149 is a deficient number, since it is larger than the sum of its proper divisors (770815).
2270553149 is an equidigital number, since it uses as much as digits as its factorization.
2270553149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 770814.
The product of its (nonzero) digits is 75600, while the sum is 38.
The square root of 2270553149 is about 47650.3216043712. The cubic root of 2270553149 is about 1314.3485714081.
The spelling of 2270553149 in words is "two billion, two hundred seventy million, five hundred fifty-three thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •