Base | Representation |
---|---|
bin | 100110110110… |
… | …0001100111101 |
3 | 1102022201002112 |
4 | 1031230030331 |
5 | 20203204031 |
6 | 2004303405 |
7 | 335052335 |
oct | 115541475 |
9 | 42281075 |
10 | 20366141 |
11 | 10550424 |
12 | 69a1b65 |
13 | 42b0c93 |
14 | 29c20c5 |
15 | 1bc462b |
hex | 136c33d |
20366141 has 4 divisors (see below), whose sum is σ = 20512800. Its totient is φ = 20219484.
The previous prime is 20366123. The next prime is 20366147. The reversal of 20366141 is 14166302.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14166302 = 2 ⋅7083151.
It is a cyclic number.
It is not a de Polignac number, because 20366141 - 210 = 20365117 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20366147) 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, 73121 + ... + 73398.
It is an arithmetic number, because the mean of its divisors is an integer number (5128200).
Almost surely, 220366141 is an apocalyptic number.
It is an amenable number.
20366141 is a deficient number, since it is larger than the sum of its proper divisors (146659).
20366141 is a wasteful number, since it uses less digits than its factorization.
20366141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146658.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 20366141 is about 4512.8861053654. The cubic root of 20366141 is about 273.0881877296.
It can be divided in two parts, 20366 and 141, that multiplied together give a triangular number (2871606 = T2396).
The spelling of 20366141 in words is "twenty million, three hundred sixty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •