Base | Representation |
---|---|
bin | 1100011100010100100… |
… | …1101100010000110001 |
3 | 202102202101010102210221 |
4 | 3013011021230100301 |
5 | 12000240312042044 |
6 | 242111145053041 |
7 | 21305124641200 |
oct | 3070511542061 |
9 | 672671112727 |
10 | 213761049649 |
11 | 827235a3504 |
12 | 35518187181 |
13 | 17208286bc4 |
14 | a4bb957237 |
15 | 5861607484 |
hex | 31c526c431 |
213761049649 has 15 divisors (see below), whose sum is σ = 249632144157. Its totient is φ = 182510823936.
The previous prime is 213761049563. The next prime is 213761049673. The reversal of 213761049649 is 946940167312.
The square root of 213761049649 is 462343.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 200710272049 + 13050777600 = 448007^2 + 114240^2 .
It is not a de Polignac number, because 213761049649 - 223 = 213752661041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 213761049596 and 213761049605.
It is not an unprimeable number, because it can be changed into a prime (213761049049) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 831754929 + ... + 831755185.
Almost surely, 2213761049649 is an apocalyptic number.
213761049649 is the 462343-rd square number.
213761049649 is the 231172-nd centered octagonal number.
It is an amenable number.
213761049649 is a deficient number, since it is larger than the sum of its proper divisors (35871094508).
213761049649 is an frugal number, since it uses more digits than its factorization.
213761049649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1042 (or 264 counting only the distinct ones).
The product of its (nonzero) digits is 1959552, while the sum is 52.
The spelling of 213761049649 in words is "two hundred thirteen billion, seven hundred sixty-one million, forty-nine thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •