Base | Representation |
---|---|
bin | 11101000110101000011… |
… | …010011000110010111101 |
3 | 21002012022102011002222202 |
4 | 131012220122120302331 |
5 | 230231432213012422 |
6 | 4130440333321245 |
7 | 264331333256105 |
oct | 35065032306275 |
9 | 7065272132882 |
10 | 1999985282237 |
11 | 701209609148 |
12 | 28373b036225 |
13 | 1167a04b0337 |
14 | 6cb2a93c205 |
15 | 37056a71b92 |
hex | 1d1a8698cbd |
1999985282237 has 2 divisors, whose sum is σ = 1999985282238. Its totient is φ = 1999985282236.
The previous prime is 1999985282227. The next prime is 1999985282327. The reversal of 1999985282237 is 7322825899991.
Together with next prime (1999985282327) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1868891321476 + 131093960761 = 1367074^2 + 362069^2 .
It is a cyclic number.
It is not a de Polignac number, because 1999985282237 - 226 = 1999918173373 is a prime.
It is a super-2 number, since 2×19999852822372 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1999985282227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 999992641118 + 999992641119.
It is an arithmetic number, because the mean of its divisors is an integer number (999992641119).
Almost surely, 21999985282237 is an apocalyptic number.
It is an amenable number.
1999985282237 is a deficient number, since it is larger than the sum of its proper divisors (1).
1999985282237 is an equidigital number, since it uses as much as digits as its factorization.
1999985282237 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 352719360, while the sum is 74.
The spelling of 1999985282237 in words is "one trillion, nine hundred ninety-nine billion, nine hundred eighty-five million, two hundred eighty-two thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •