Base | Representation |
---|---|
bin | 1001111110101001101111… |
… | …0100001111001001111001 |
3 | 1102211220112210122101221101 |
4 | 2133222123310033021321 |
5 | 2414231033410323100 |
6 | 35200241002411401 |
7 | 2211461261420434 |
oct | 237523364171171 |
9 | 42756483571841 |
10 | 10971960636025 |
11 | 3550200816834 |
12 | 1292533500b61 |
13 | 61786130311c |
14 | 29d08d69a81b |
15 | 140614c6986a |
hex | 9fa9bd0f279 |
10971960636025 has 27 divisors (see below), whose sum is σ = 13685360432653. Its totient is φ = 8726173388000.
The previous prime is 10971960635983. The next prime is 10971960636029. The reversal of 10971960636025 is 52063606917901.
The square root of 10971960636025 is 3312395.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 618341604409 + 10353619031616 = 786347^2 + 3217704^2 .
It is not a de Polignac number, because 10971960636025 - 219 = 10971960111737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10971960636029) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2964591675 + ... + 2964595375.
Almost surely, 210971960636025 is an apocalyptic number.
10971960636025 is the 3312395-th square number.
10971960636025 is the 1656198-th centered octagonal number.
It is an amenable number.
10971960636025 is a deficient number, since it is larger than the sum of its proper divisors (2713399796628).
10971960636025 is an frugal number, since it uses more digits than its factorization.
10971960636025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7770 (or 3885 counting only the distinct ones).
The product of its (nonzero) digits is 3674160, while the sum is 55.
The spelling of 10971960636025 in words is "ten trillion, nine hundred seventy-one billion, nine hundred sixty million, six hundred thirty-six thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •