Base | Representation |
---|---|
bin | 110011010000110… |
… | …1111001100011101 |
3 | 11102212201011011121 |
4 | 1212201233030131 |
5 | 12010322320333 |
6 | 442404050541 |
7 | 60424531246 |
oct | 14641571435 |
9 | 4385634147 |
10 | 1720120093 |
11 | 802a6575a |
12 | 400093a51 |
13 | 2154a2553 |
14 | 124641ccd |
15 | a102a32d |
hex | 6686f31d |
1720120093 has 2 divisors, whose sum is σ = 1720120094. Its totient is φ = 1720120092.
The previous prime is 1720120063. The next prime is 1720120111. The reversal of 1720120093 is 3900210271.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1597840729 + 122279364 = 39973^2 + 11058^2 .
It is an emirp because it is prime and its reverse (3900210271) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1720120093 - 29 = 1720119581 is a prime.
It is a super-3 number, since 3×17201200933 (a number of 29 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1720120063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 860060046 + 860060047.
It is an arithmetic number, because the mean of its divisors is an integer number (860060047).
Almost surely, 21720120093 is an apocalyptic number.
It is an amenable number.
1720120093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1720120093 is an equidigital number, since it uses as much as digits as its factorization.
1720120093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 25.
The square root of 1720120093 is about 41474.3305310646. The cubic root of 1720120093 is about 1198.1731677683.
The spelling of 1720120093 in words is "one billion, seven hundred twenty million, one hundred twenty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •