Base | Representation |
---|---|
bin | 100111100110… |
… | …0101000000101 |
3 | 1110001202212101 |
4 | 1033030220011 |
5 | 20303323333 |
6 | 2020552101 |
7 | 341315653 |
oct | 117145005 |
9 | 43052771 |
10 | 20761093 |
11 | 107a0131 |
12 | 6b52631 |
13 | 43bb992 |
14 | 2a85dd3 |
15 | 1c5167d |
hex | 13cca05 |
20761093 has 2 divisors, whose sum is σ = 20761094. Its totient is φ = 20761092.
The previous prime is 20761087. The next prime is 20761099. The reversal of 20761093 is 39016702.
It is a balanced prime because it is at equal distance from previous prime (20761087) and next prime (20761099).
It can be written as a sum of positive squares in only one way, i.e., 19918369 + 842724 = 4463^2 + 918^2 .
It is a cyclic number.
It is not a de Polignac number, because 20761093 - 217 = 20630021 is a prime.
It is a super-3 number, since 3×207610933 (a number of 23 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20761099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10380546 + 10380547.
It is an arithmetic number, because the mean of its divisors is an integer number (10380547).
Almost surely, 220761093 is an apocalyptic number.
It is an amenable number.
20761093 is a deficient number, since it is larger than the sum of its proper divisors (1).
20761093 is an equidigital number, since it uses as much as digits as its factorization.
20761093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 28.
The square root of 20761093 is about 4556.4342418167. The cubic root of 20761093 is about 274.8421926560.
Adding to 20761093 its reverse (39016702), we get a palindrome (59777795).
The spelling of 20761093 in words is "twenty million, seven hundred sixty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •