Base | Representation |
---|---|
bin | 10011011110101100… |
… | …010000111101011101 |
3 | 1222222200011122112001 |
4 | 103132230100331131 |
5 | 320313444434231 |
6 | 13335250442301 |
7 | 1340214123253 |
oct | 233654207535 |
9 | 58880148461 |
10 | 20916014941 |
11 | 89635aa668 |
12 | 4078893391 |
13 | 1c843ba903 |
14 | 1025c105d3 |
15 | 8263acb61 |
hex | 4deb10f5d |
20916014941 has 4 divisors (see below), whose sum is σ = 20919968892. Its totient is φ = 20912060992.
The previous prime is 20916014939. The next prime is 20916014971. The reversal of 20916014941 is 14941061902.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 19803525625 + 1112489316 = 140725^2 + 33354^2 .
It is a cyclic number.
It is not a de Polignac number, because 20916014941 - 21 = 20916014939 is a prime.
It is a super-3 number, since 3×209160149413 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20916014941.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20916014971) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1969030 + ... + 1979623.
It is an arithmetic number, because the mean of its divisors is an integer number (5229992223).
Almost surely, 220916014941 is an apocalyptic number.
It is an amenable number.
20916014941 is a deficient number, since it is larger than the sum of its proper divisors (3953951).
20916014941 is an equidigital number, since it uses as much as digits as its factorization.
20916014941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3953950.
The product of its (nonzero) digits is 15552, while the sum is 37.
The spelling of 20916014941 in words is "twenty billion, nine hundred sixteen million, fourteen thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •