Base | Representation |
---|---|
bin | 100110010111… |
… | …0110100000101 |
3 | 1101211221011122 |
4 | 1030232310011 |
5 | 20122132233 |
6 | 1555043325 |
7 | 332654264 |
oct | 114566405 |
9 | 41757148 |
10 | 20114693 |
11 | 10399515 |
12 | 68a0545 |
13 | 42236b1 |
14 | 29585db |
15 | 1b74d98 |
hex | 132ed05 |
20114693 has 4 divisors (see below), whose sum is σ = 20455680. Its totient is φ = 19773708.
The previous prime is 20114687. The next prime is 20114701. The reversal of 20114693 is 39641102.
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: 39641102 = 2 ⋅19820551.
It is a cyclic number.
It is not a de Polignac number, because 20114693 - 222 = 15920389 is a prime.
It is a super-3 number, since 3×201146933 (a number of 23 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20114663) 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, 170405 + ... + 170522.
It is an arithmetic number, because the mean of its divisors is an integer number (5113920).
Almost surely, 220114693 is an apocalyptic number.
It is an amenable number.
20114693 is a deficient number, since it is larger than the sum of its proper divisors (340987).
20114693 is an equidigital number, since it uses as much as digits as its factorization.
20114693 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340986.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 20114693 is about 4484.9406908007. The cubic root of 20114693 is about 271.9596474524.
Adding to 20114693 its reverse (39641102), we get a palindrome (59755795).
The spelling of 20114693 in words is "twenty million, one hundred fourteen thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •