Base | Representation |
---|---|
bin | 1001001000111010101000… |
… | …10101101011011010010001 |
3 | 2122011022022222212221120221 |
4 | 10210131110111223122101 |
5 | 10113234304114300321 |
6 | 110424410024233041 |
7 | 4143000305261200 |
oct | 444352425533221 |
9 | 78138288787527 |
10 | 20097566946961 |
11 | 644936a6653a9 |
12 | 230706260b781 |
13 | b2a266a0400a |
14 | 4d6a280d7237 |
15 | 24cbb56bae41 |
hex | 12475456b691 |
20097566946961 has 81 divisors (see below), whose sum is σ = 25386782767227. Its totient is φ = 15861322320480.
The previous prime is 20097566946931. The next prime is 20097566946973. The reversal of 20097566946961 is 16964966579002.
The square root of 20097566946961 is 4483031.
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., 17983578897025 + 2113988049936 = 4240705^2 + 1453956^2 .
It is not a de Polignac number, because 20097566946961 - 29 = 20097566946449 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20097566946931) by changing a digit.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 22060995096 + ... + 22060996006.
Almost surely, 220097566946961 is an apocalyptic number.
20097566946961 is the 4483031-st square number.
20097566946961 is the 2241516-th centered octagonal number.
It is an amenable number.
20097566946961 is a deficient number, since it is larger than the sum of its proper divisors (5289215820266).
20097566946961 is an frugal number, since it uses more digits than its factorization.
20097566946961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1948 (or 974 counting only the distinct ones).
The product of its (nonzero) digits is 264539520, while the sum is 70.
The spelling of 20097566946961 in words is "twenty trillion, ninety-seven billion, five hundred sixty-six million, nine hundred forty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •