Base | Representation |
---|---|
bin | 11111110111011000000… |
… | …101011001001100010001 |
3 | 21202100011101121212220121 |
4 | 133313120011121030101 |
5 | 241334113443134400 |
6 | 4353544042310241 |
7 | 314130245612041 |
oct | 37673005311421 |
9 | 7670141555817 |
10 | 2189763646225 |
11 | 774745544981 |
12 | 2b44834b8381 |
13 | 12b655c20a7c |
14 | 77db1285721 |
15 | 3be6295821a |
hex | 1fdd8159311 |
2189763646225 has 27 divisors (see below), whose sum is σ = 2806016884731. Its totient is φ = 1695123313200.
The previous prime is 2189763646207. The next prime is 2189763646241. The reversal of 2189763646225 is 5226463679812.
It is a happy number.
The square root of 2189763646225 is 1479785.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 788314912641 + 1401448733584 = 887871^2 + 1183828^2 .
It is not a de Polignac number, because 2189763646225 - 219 = 2189763121937 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 229361902 + ... + 229371448.
Almost surely, 22189763646225 is an apocalyptic number.
2189763646225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
2189763646225 is the 1479785-th square number.
2189763646225 is the 739893-rd centered octagonal number.
It is an amenable number.
2189763646225 is a deficient number, since it is larger than the sum of its proper divisors (616253238506).
2189763646225 is an frugal number, since it uses more digits than its factorization.
2189763646225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19166 (or 9583 counting only the distinct ones).
The product of its digits is 52254720, while the sum is 61.
The spelling of 2189763646225 in words is "two trillion, one hundred eighty-nine billion, seven hundred sixty-three million, six hundred forty-six thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •