Base | Representation |
---|---|
bin | 100111100000… |
… | …1110110100101 |
3 | 1102222112100000 |
4 | 1033001312211 |
5 | 20300420330 |
6 | 2020011513 |
7 | 341043213 |
oct | 117016645 |
9 | 42875300 |
10 | 20716965 |
11 | 1076aa65 |
12 | 6b30b99 |
13 | 43a4879 |
14 | 2a73cb3 |
15 | 1c43560 |
hex | 13c1da5 |
20716965 has 72 divisors (see below), whose sum is σ = 40229280. Its totient is φ = 10222848.
The previous prime is 20716963. The next prime is 20716967. The reversal of 20716965 is 56961702.
It is an interprime number because it is at equal distance from previous prime (20716963) and next prime (20716967).
It is not a de Polignac number, because 20716965 - 21 = 20716963 is a prime.
It is a super-2 number, since 2×207169652 = 858385277622450, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20716961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 351106 + ... + 351164.
It is an arithmetic number, because the mean of its divisors is an integer number (558740).
It is a vampire number, since it can be written as 2601 ⋅ 7965 (with its own digits).
Almost surely, 220716965 is an apocalyptic number.
It is an amenable number.
20716965 is a deficient number, since it is larger than the sum of its proper divisors (19512315).
20716965 is an equidigital number, since it uses as much as digits as its factorization.
20716965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113 (or 84 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The square root of 20716965 is about 4551.5892828769. The cubic root of 20716965 is about 274.6473275245.
The spelling of 20716965 in words is "twenty million, seven hundred sixteen thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •