Base | Representation |
---|---|
bin | 11110101001001001010… |
… | …011010001110101111001 |
3 | 21110022100022000211020201 |
4 | 132221021103101311321 |
5 | 234000101011000000 |
6 | 4251212521322201 |
7 | 305064534452002 |
oct | 36511123216571 |
9 | 7408308024221 |
10 | 2105763765625 |
11 | 74205a826353 |
12 | 2a0140036361 |
13 | 12375a209a00 |
14 | 73cc31c81a9 |
15 | 39b9823996a |
hex | 1ea494d1d79 |
2105763765625 has 189 divisors, whose sum is σ = 3073492123641. Its totient is φ = 1441837800000.
The previous prime is 2105763765499. The next prime is 2105763765631. The reversal of 2105763765625 is 5265673675012.
The square root of 2105763765625 is 1451125.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 10 ways, for example, as 987855100281 + 1117908665344 = 993909^2 + 1057312^2 .
It is not a de Polignac number, because 2105763765625 - 215 = 2105763732857 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 188 ways as a sum of consecutive naturals, for example, 44803484352 + ... + 44803484398.
Almost surely, 22105763765625 is an apocalyptic number.
2105763765625 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
2105763765625 is the 1451125-th square number.
2105763765625 is the 725563-rd centered octagonal number.
It is an amenable number.
2105763765625 is a deficient number, since it is larger than the sum of its proper divisors (967728358016).
2105763765625 is an frugal number, since it uses more digits than its factorization.
2105763765625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188 (or 84 counting only the distinct ones).
The product of its (nonzero) digits is 15876000, while the sum is 55.
The spelling of 2105763765625 in words is "two trillion, one hundred five billion, seven hundred sixty-three million, seven hundred sixty-five thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •